Very stiff. Mostly did not answer questions only asked for the solution. Pretty easy algorithms on a level of easy/medium. Hard sql where the first task was pretty easy however second one took me 30 minutes to figure out.
Questions d'entretien [1]
Question 1
Write the minmum distance between to vectors:
v1 = [23, 0, 10]
v2 = [17, -4, 22]
Func(v1, v2) shoul return 1 (v1[0] - v2[2])
J'ai postulé via un recruteur. J'ai passé un entretien chez Yandex (Belgrade) en févr. 2025
Entretien
3 rounds of general interviews (leetcode, ml theory, recsys related) and then one per product team.
Leetcode was not that hard, the last question made me think tho, that was not a regular "invert a linked list" problem but more like a geometry/general math related problem, enjoyed solving it.
Questions d'entretien [1]
Question 1
Asked about biases in designing a recommendation system and ways to avoid them.
J'ai postulé en ligne. Le processus a pris 1 jour. J'ai passé un entretien chez Yandex (Moscou, ) en sept. 2024
Entretien
1 hour, 2 algo tasks were given. First one was easy task from leetcode (free), second - medium task (two pointers).
I solved only first one, so didn't got the position.