Glassdoor users rated their interview experience at Yandex as 100% positive with a difficulty rating score of 3 out of 5 (where 5 is the highest level of difficulty). Candidates interviewing for Sales Representative and rated their interviews as the hardest, whereas interviews for Sales Representative and roles were rated as the easiest.
The hiring process at Yandex takes an average of 30 days when considering 1 user submitted interviews across all job titles. Candidates applying for Sales Representative had the quickest hiring process (on average 30 days), whereas Sales Representative roles had the slowest hiring process (on average 30 days).
There are three 3 programming interviews and one machine learning. In fact, all of them are leet code interviews (even machine learning interview was about algorithms and data structures). I was asked about my experience in computer vision during ml interview. Then I should solve two algorithmic exercises. Sometimes interviewer was rude and impolite. Also HR said that I would get answer in a week but disappeared for two moths
I applied online. The process took 2 weeks. I interviewed at Yandex (Moscovo, ) in Mar 2021
Interview
There were 1 theoretical and 2 algorithmic tasks to test my knowledge of the programming language (C++).
Whole interview took 1 hour.
The interviewer was friendly and polite.
He corrected me in code, where I were wrong.
Interview questions [1]
Question 1
Theoretical task was to sum 20 float numbers with maxim precision.
I applied through an employee referral. I interviewed at Yandex (Moscovo, ) in Feb 2018
Interview
The interview had five coding sections and one system design section.
I rate coding sections as tough enough, but they were extremely interesting. The code must be written on whiteboard, without any compiler or debugger. At the first glance it was confusing, but after the first problem, whiteboarding of the next ones becomes easier.
All the interviewers were very friendly.
Interview questions [1]
Question 1
One of the coding section problem were "how to find a subrange with maximum sum".