J'ai postulé en ligne. Le processus a pris 5 jours. J'ai passé un entretien chez Amazon (Bengaluru) en sept. 2025
Entretien
The interview began with mutual introductions and quickly transitioned into technical topics. I was asked to explain Trees vs. Graphs and their differences. Then came two DSA problems: one on greedy scheduling (N meeting rooms + merging overlapping intervals) and another on string validation (checking for repeated words). I discussed time and space complexities for both problems. The session was interactive, with follow-up questions and a focus on problem-solving. I had only 1.5 days to prepare after a short-notice phone call, so I prioritized DSA and showed less interest in theoretical concepts. Although I wasn’t selected, the experience was fast-paced and engaging, and it helped sharpen my technical thinking under pressure.
Questions d'entretien [1]
Question 1
Can you solve the N meeting rooms problem using a greedy approach and explain how it relates to merging overlapping intervals?
The loop consists of 4–5 back-to-back interviews, each lasting 45–60 minutes. Your panel will typically include your potential hiring manager, 1–2 team members, a senior leader, and the Bar Raiser. Every interviewer is assigned 2–3 specific Leadership Principles to evaluate. Together, the panel covers all 16 principles across the loop.
Interview mainly consisted of DSA and questions on Leadership Principles.
Also slightly emphasizing on Low level design.Interview sort of helped me with the approach and asked me to explain the time and space complexity
J'ai postulé via un recruteur. J'ai passé un entretien chez Amazon
Entretien
The interview process started with an initial recruiter screening, followed by technical interview rounds. The technical interviews focused on data structures, algorithms, problem-solving, and discussing my approach clearly. The interviewers also asked behavioral questions related to teamwork, challenges, and past projects. Overall, the process was structured and professional.
Questions d'entretien [1]
Question 1
Given a binary tree, how would you find the lowest common ancestor of two nodes if each node also has a parent pointer?