Had a OA first, then two virtual rounds with engineers. Mostly LeetCode-style questions and one system design. Final round was behavioral, pretty focused on leadership principles. Overall, pretty structured but intense.
Preguntas de entrevista [1]
Pregunta 1
had a question on implementing an LRU Cache from scratch. had to use a combination of a hashmap and a doubly linked list. Took most of the session.
Me postulé en línea. Acudí a una entrevista en Amazon
Entrevista
Interview revolves around Data structure and algorithm, ther askes 2 dsa questions, plus some 2 behavioural question. Interview duration is one hour, to clear that round i have to solve both the question completely within time
Preguntas de entrevista [1]
Pregunta 1
You are given two lists of closed intervals, firstList and secondList, where firstList[i] = [starti, endi] and secondList[j] = [startj, endj]. Each list of intervals is pairwise disjoint and in sorted order.
Return the intersection of these two interval lists.
A closed interval [a, b] (with a <= b) denotes the set of real numbers x with a <= x <= b.
The intersection of two closed intervals is a set of real numbers that are either empty or represented as a closed interval. For example, the intersection of [1, 3] and [2, 4] is [2, 3].
Me postulé en línea. El proceso tomó 6 meses. Acudí a una entrevista en Amazon (Bengaluru) en jul 2025
Entrevista
1 hour interview with 2 leetcode questions with medium/ hard difficulty. The interviewer helps you if you get lost. Try to write optimal code. I got a variation of house robber question.
Preguntas de entrevista [1]
Pregunta 1
Variation of house robber and another was about binary trees
