I applied online. The process took 1 day. I interviewed at Amazon in Oct 2011
Interview
This was a phone screen. I've already posted the onsite interview information. It was your typical hour long technical phone screen. I was asked:
- What is the difference between a linked list and an array
- Describe mergesort and its runtime
- What is a hash table, hash function, runtimes, collision, etc.
- What is a Binary Search Tree, runtimes... pros/cons vs hash table
- Lowest Common Ancestor (See below)
Interview questions [1]
Question 1
Imagine a data structure similar to a Binary Tree except, rather than each node pointing to is lchild and rchild, it only points to its parent. Write a function that, given two nodes into such a structure, returns their Lowest Common Ancestor - the lowest node in the tree which where both subtrees meet.
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.
I applied online. I interviewed at Amazon (Calgary, AB) in Jun 2026
Interview
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.
Interview questions [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