J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 4 semaines. J'ai passé un entretien chez Amazon (Bānkura) en juin 2023
Entretien
Format: 30–60 minutes; phone or video call.
Conducted by: A hiring manager or Amazon employee.
What they assess:
Technical skills (coding, architecture for tech roles).
Behavioral questions based on Leadership Principles.
Tools: Online coding platform like Amazon Chime, CoderPad, or shared docs.
Tip: Practice STAR (Situation, Task, Action, Result) for behavioral answers.
Questions d'entretien [1]
Question 1
Interviewers: Mix of team members, hiring manager, and a Bar Raiser.
Focus areas:
Behavioral: Deep dive into Amazon’s 16 Leadership Principles.
Technical: System design, data structures, algorithms (SDE roles).
Role-specific: Product strategy (PM), project execution (TPM), analytics (BA), etc.
Bar Raiser: A specially trained Amazonian who ensures hiring quality and cultural fit.
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?