Le processus a pris 1 jour. J'ai passé un entretien chez Amazon (Seattle, WA) en nov. 2011
Entretien
I was selected to bypass a phone screening and attend an on-site interview with a large group of other interviewees (though the interviews itself were on an individual basis). The interview day consisted of 4, 45 minute technical interviews each conducted by a different interviewer. Coding on the whiteboard is required (or sometimes on paper), and each of the interviews you are given a complex coding question that you must solve in front of them. These questions may be relatively simple if you remember all of your algorithm knowledge from college very well, otherwise you must go in with a significant knowledge of trees (binary and binary search, etc), data structures in general, searching and sorting algorithms, object oriented programming, just to name a few.
Questions d'entretien [1]
Question 1
Given two very large binary trees T1, with millions of nodes, and T2, with hun- dreds of nodes, create an algorithm to decide if T2 is a subtree of T1.
It started with an OA, and then after a few weeks, I got invited to four rounds of interviews: technical and behavioral at 3 of the 4, and behavioral only at one.
J'ai postulé en ligne. J'ai passé un entretien chez Amazon (Calgary, AB) en juin 2026
Entretien
Online Assessment is the first step in the process. I didn’t have an HR phone screening and went straight to the OA after applying. It was sent to me about a week after I submitted my application.
Questions d'entretien [1]
Question 1
The first question is LeetCode style algorithms question, and the second question gives a full stack repo (choice of Java, NodeJS, or Django) and asks to solve a backend issue which is causing a bug in the frontend. Unit tests must pass to pass the second question. You can run both backend/frontend indivdually or together