Apple Phone Screen
- Result
- Ongoing
- Posted
- 21 Oct 2025
428 reads
Summary
I recently had a phone screen with Apple where I was asked to convert a sorted linked list into a balanced binary search tree.
How it went
During my phone screen with Apple, the interviewer presented me with a classic data structure problem. I was given a sorted linked list of integers and tasked with implementing a method to transform it into a balanced binary search tree. The problem statement included a clear example to illustrate the expected output from a given linked list input.
Questions asked (1)
- 01
Convert Sorted Linked List to Balanced BST
Data Structures & Algorithms · Medium
Given a sorted linked list of integers, write a method(s) to create a balanced binary search tree from the list.
Example:1 -> 2 -> 5 -> 6 -> 8 -> 10 -> 19
Expected Output:6 /
2 10 / \ /
1 5 8 19
Input :LinkedList head
Output :TreeNode root