I applied online. The process took 4 weeks. I interviewed at Yandex in Sept 2023
Interview
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 .
Interview questions [1]
Question 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.
I applied through a recruiter. I interviewed at Yandex
Interview
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.
Interview questions [1]
Question 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
Interview questions [1]
Question 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?