I applied through an employee referral. I interviewed at Yandex
Interview
1) Write code online (usually 1-2 problems on algorithms)
2) Series of 1-on-1 meetings with the team (and maybe others) - algorithms section, language section, architecture...
3) Meeting with the team leader (fit basically), negotiating comp, where you see yourself in X years, stuff like that
Interview questions [1]
Question 1
Imagine you are writing new messanger. Go through the architecture
I applied online. The process took 4 weeks. I interviewed at Yandex (Moskau, ) in Jun 2016
Interview
Interview process was smart. Contacted by HR after application on hh.ru.
There were three steps of interview process: skype(1 hour), onsite(4 hours) and 'homework'(1 week). Interviewers were very professional and helped me a lot to succeed.
Interview questions [2]
Question 1
Skype interview: fibonacci number effectively, exponentiation by squaring. Python-specific questions(what is context manager, descriptor, meta class, etc). My favorite sorting algos and their complexities. Big O. Omega and Theta notations.
Onsite interview.
1. Effective data structure for read, write and delete in O(1).
2. Rand(3) out of given Rand(2).
3. Sort array bigger than RAM.
4. DFS implementation.
5. Iterator which skips each second element (Java implementation was asked).
6. Brainteaser about size of in a train with light bulbs.
I applied online. The process took 1 day. I interviewed at Yandex (Moskau, ) in Oct 2017
Interview
It was a Skype online interview using Skype Interview edition for online tasks solving. Interview duration was 50 minutes. First of all, I've presented my current and former job experience. Then answered my best achievement over last year. The remaining time was spent solving coding questions in the online editor.
The interviewer told that the recruiter will send me the decision result by e-mail.
Interview questions [2]
Question 1
Write a function to calculate the dot product of RLE-encoded vectors. Throw an exception in case of incorrect arguments.
Let suppose that for a given set of natural numbers we found the subset with maximum possible elements sum. There is only one limitation for a subset: sum of the two smallest elements must be greater that the maximal element.
Write a function to calculate the sum of that subset that maximizes elements sum according to limitation.
Estimate algorithmic complexity of your solution.