Envié una solicitud electrónica. El proceso duró 4 semanas. Acudí a una entrevista en Yandex (San Petersburgo, ) en ago 2015
Entrevista
Applied online via yandex website for position at St.Petersburg. After a several days got a email from yandex for the first technical interview. The 1st interview was quite easy: questions about what sorting algorithms you know, two-sum array, median of 3 nos, etc.
After about a week got email for the 2nd technical interview (via skype). This one was relatively hard with 3 engineers asking question about C/C++/STL, multi-threading and algorithms.
Questions like: exception in ctor, if dtors of base classes get called,
find if a singly-linked list contains a loop, make random3() using random2(), write a smart-pointer class,
programming question about multi-threading and lock-free implementation.
Just after several days, I was invited for f2f interview in St.Petersburg. There it was a task to implement an algorithm using STL (no Internet obviously) in 4 hours. Was quite hard, though the algorithm was not that complicated (it was just you feeling a time pressure and try to code very fast). After about a week I got a email from the HR that they want to work with me but my salary expectations were rather different from theirs.. So I had to turn it down.
But, altogether, positive experience, friendly HR and interviewers ;)
Preguntas de entrevista [1]
Pregunta 1
1. There were some questions about Python and SQL that I did not expect as I applied for C++ dev. position.
2. Got confused by a simple question about endianness of x86 cpus.
3. Mixed up rvalue semantics in another C++ question
Solicité el puesto a través de un captador. Acudí a una entrevista en Yandex
Entrevista
After a positive HR screening, my technical interview was delayed by a week because the recruiter lost track of our initial conversation and tried to redo the screening. When the technical interview finally took place, I successfully solved both algorithmic tasks on time. Despite the smooth technical performance, the company chose to go with a different candidate.
Preguntas de entrevista [1]
Pregunta 1
1. One task related to Merge Sort Technique.
2. Another one was to move all 0s in array to the end of array using O(n) approach.
It was the first stage algorithm interview, after which I've got two more algorithm sections and one architectural.
On an architectural stage I was asked to design backend for traffic-jam app like Traffic Alert.
After all process was finished I've got proper feedback for all stages no matter how it was going
Preguntas de entrevista [1]
Pregunta 1
You have N words in lowercase english letters only.
Retrun 100 words that have the most occurence freqency in the original set
* could you solve this faster than nlogn?
Envié una solicitud electrónica. El proceso duró 4 semanas. Acudí a una entrevista en Yandex en sept 2023
Entrevista
The overall experience was disheartening, especially considering the time and effort invested. The recruitment team is very unprofessional, and has lack of experience on working with Senior level. The interview phases, which comprised one architectural discussion and two coding sessions, were fairly standard. Feedback post-interviews was positive. However, there was a significant disconnect when it came to compensation. The offered salary was a surprising 40% below my previously stated expectations, that was clearly communicated ahead. No clear answer about this difference was given, even no official mail sent, primarily all communication was done through informal Telegram calls .
Preguntas de entrevista [1]
Pregunta 1
Q1: List of numbers with unique values as I put. And need to have a result like this [1,4,5,2,3,9,8,11,0] => "0-5,8-9,11"' [1,4,3,2] => "1-4" Q2: Given a tree with character values only, 2 nodes are similar if the set of elements in that subtrees have same elements. Find whether there are any similar nodes.
