Software Development Engineer 1
Convert Linked List to Height-Balanced BST
Explain how to convert a sorted linked list into a height-balanced binary search tree (BST). Discuss your approach and the time complexity involved.
This question was asked in
Amazon Software Development Engineer 1 Interview Experience
The Amazon interview process included four rounds, starting with online assessments focused on medium and hard DSA problems, followed by in-person problem-solving rounds featuring graph and interval-based questions, along with discussions on Leadership Principles. The final round involved a deep dive into the candidate's professional experience, including detailed discussions on a generative AI system and data queries. Overall, the interview experience at Amazon appears rigorous, emphasizing a balance of technical complexities and behavioral assessments.