Me postulé en línea. Acudí a una entrevista en Nebius (Ámsterdam) en feb 2025
Entrevista
Long process with 2-3 week gaps in between the interviews. It took about 8-9 weeks in total to go through 3 coding sessions.
Coding tasks are easy to light medium (1 case) leetcode level.
The biggest challenge was that 2 out of 3 interviewers were not fully competent in tech areas they were discussing. And they would not accept any reasoning and act in a "boss culture" mode instead, going as far as putting pure lies in their interview notes.
Default way of communication from HR was to just keep silence. After some extensive pushing I've got a GPT generated response. And after another round of pushing I was able to get a short summary of interview notes.
Company is apparently aiming for faang style tech interviews, but fails miserably on implementation. Interviewers are going for cargo cult ego boost sessions with almost nothing in the process being related to a real technical expertise. The outcome of such a process is purely random of course.
Enormous waste of time.
Initial HR screening call, followed by a technical interview
Technical Interviewer was not particularly interested after a few minutes, never heard back about whether or not things would move ahead
I was applying through the referral. There was promised 4-5 stages with 3 technical. Unfortunatelly, after the 3rd tech interview I was withdrawn from the process with the standard answer "we have more technically skilled candidates". No other details were provided and no feedback even after I explicitly asked the recruiter. Overall, the process was not bad, and I still glad I got the chance to join the team. BTW, all the tasks were finished and worked, but my solution for the last one was not so optimal, and I didn't come up with the corner case, but I was able to handle it after I got a clue.
Preguntas de entrevista [1]
Pregunta 1
Design a new data structure with O(1) time complexity for add/delete/get/get_random methods.
Why accessing value by key in the dict structure is Average O(1) time complexity.
Write an algorithm to compress strings like AAAABB into A4B2 with no extra memory.
