Surprisingly easy — I expected tougher questions, but the coding round felt more like a warm-up. The main challenge was a DSA problem about counting islands in a 2D grid, which led to a discussion on DFS versus BFS and handling large grids. Funny enough, I had revisited that exact type of question while prepping on PracHub, which made me feel more confident. The interview wrapped up with a behavioral round, and I accepted an offer, but ultimately decided to decline it for another opportunity. Overall, it was a smooth experience.
Questions d'entretien [1]
Question 1
Number of Islands — given a 2D grid of '1's (land) and '0's (water), count the number of connected islands. Walk through DFS vs BFS, and discuss how to avoid revisiting cells (in-place mutation vs visited set) and what changes if the grid is huge and must stream from disk.
J'ai postulé en ligne. Le processus a pris 1 jour. J'ai passé un entretien chez Amazon en oct. 2011
Entretien
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)
Questions d'entretien [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.
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