Breadth First Search or BFS for a Graph. The breadth-first search (BFS) algorithm is used to search a tree or graph data structure for a node that meets a set of criteria.
I received an Online Assessment (OA) invitation from Amazon. The assessment consisted of two coding questions of medium to hard difficulty, focusing on data structures, algorithms, and problem-solving skills. The questions required efficient solutions with optimized time and space complexity. After the OA, shortlisted candidates typically proceed to one or more technical interview rounds covering coding, system design, and behavioral questions based on Amazon's Leadership Principles.
Applied online via career site, received OA link within 2 days and cleared it, Round 1- DSA, Round-2 DSA, Round 3- System Design, Round 4- Mixed Technical Discussion and Behavioral.
Interview questions [1]
Question 1
Number of Islands (LC 200 - Medium): You are heavily advised to know how to traverse connected components using a 2D grid.
I applied through university. I interviewed at Amazon (Patiala) in June 2026
Interview
Amazing process, was asked 2 dsa questions then hashmap internals and then basic introduction in dsa question i was given hints too, ovrall a great experience, will recommend everyone in the house