Applied and after a week got an online assignment which required to be completed. The assignment contained 3 questions which required to be coded in Java or C++
Domande di colloquio [1]
Domanda 1
Deep copy of a list list containing a pointer to the next node and also a pointer to a random other node ( could be a node ahead in the list, the node itself, somewhere behind or NULL)
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.
Domande di colloquio [1]
Domanda 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.
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.
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Amazon (Calgary, AB) nel mese di giu 2026
Colloquio
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.
Domande di colloquio [1]
Domanda 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