It was an interview with 2 dsa questions. One was find path of the maximum diameter of the binary tree. Another was a recursion question to find max element
With almost k swaps
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