Due to the pandemic, the interview took place via several zoom sessions. Despite the fact that I was attending the foodtech Yandex division, most of the sections were conducted by Yandex.Taxi employees.
After all of the programming and the architecture sections, I was offered the Software Engineer position, which I refused.
Interview questions [1]
Question 1
Design a geocaching algorithm for the taxi drivers
I applied online. The process took 1 day. I interviewed at Yandex (Moskau, ) in Jun 2016
Interview
Had a hourly conversation with a head of one of software development groups. Despite overall spectra of matters been discussed, the feeling that the expertise is somewhat pigeonholed (which is a great issue to North-European companies) did persisted. Nak-ed offer in advance because I had no real intention to work in there.
There was no ugly 'write syntax-correct code on a paper' things but this may be because I`ve made my point from the beginning and the interviewer wanted just to exchange expertise points instead of diving into these procedures.
Interview questions [1]
Question 1
As the interview was resembled more expertise exchange, there was no 'hard' or solid questions, may be few half-quizzes on real or imaginary infrastructure and software problems.
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.