behavior 15 min and 45 min coding (binary search with bounding check)
behavior question is easy
I suggest people to be careful with details in the question to avoid missing edge cases
I applied online. The process took 1 day. I interviewed at Amazon (Jaipur, Rajasthan) in Mar 2024
Interview
it was online interview where interviewer asked DSA questions mostly and gave medium questions while giving enough time to be able to solve questions and answer and had only one round
30 min 1 Round only I was in process from the campus internships.
This round was highly biased in terms of diversity hiring . They asked about Trees and opposite LCA and [0 1 2] sorting .
Interview questions [1]
Question 1
There is a Binary Tree,
Input - 2 nodes to the function
Output - Yes ,if they are are Cousins else No
Constraints - Cousins means they should be on same level but nodes should be from different parent Nodes.