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.
Online Assessment: Two leetcode easy/medium questions Virtual Workplace: What would you do questions in hypothetical workplace scenarios Two back to back 60 minute live interviews: Typical Behavioural questions which are then followed by a technical question
Interview questions [1]
Question 1
Name a time you couldn't complete a task on time and what did you do?
Phone call interview for 30 mins interview call, first 5 mins self introduction and then goes for interview regarding questions which I coded in initial assessment round and asked for justification to my approach