Ho presentato la mia candidatura online. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Yandex nel mese di feb 2023
Colloquio
30 mins of theory, 30 mins for 2 whiteboard algorithms that should take at least 1 hour. Some extra time for candidate's questions. Sometimes it has a pre-interview section when you need to code algos online alone.
Domande di colloquio [1]
Domanda 1
Linked list rotation without usage of extra memory.
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Yandex (Mosca, ) nel mese di mar 2023
Colloquio
Very easy and transparent a review process. Interesting questions and tasks. I passed an architectural interview and algorithm interview. Both were well structured and interesting. Positive vibes from HR. Competitive offer and fully described feedback.
Domande di colloquio [1]
Domanda 1
What would you do in a conflicting situation which is caused by different teams points
Ho presentato la mia candidatura online. La procedura ha richiesto più di una settimana. Ho sostenuto un colloquio presso Yandex (Mosca, ) nel mese di nov 2015
Colloquio
Applied through website. Got contacted by recruiter within few hours and scheduled Skype technical interview few days later. It was one hour interview with on of their software engineers, all about Java. After that they invite me to the on-site interview. It was total six 1-hour face-to-face sections with software engineers, 1 launch with HR and two sections with two different managers. One technical section was Android background checking and other five techical sections was based on algorithm problem solving. Managers asked about my previous experience and projects I have worked on. After few days got contacted again with news about my success and received offer one day later.
Domande di colloquio [4]
Domanda 1
Given a NxM boolean matrix find a shortest way from on item to another. False means you can go here, True means you can't (obstacle). You can go left, right, top and bottom.
Given a matrix of numbers write a function that calculates sum of numbers within some bounds. You can do precalculations if needed. Main function must have O(1) complexity.
