Binary Search on linked list
Last updated: September 5, 2025
Quick Overview
Given a sorted singly linked list and a target value, implement a binary search algorithm to determine if the target value exists in the list. Return true if the target is found, and false otherwise. You may not convert the linked list to an array or use any additional data structures.
Zillow
September 5, 202550
13
3,615 solved
Given a sorted singly linked list and a target value, implement a binary search algorithm to determine if the target value exists in the list. Return true if the target is found, and false otherwise. You may not convert the linked list to an array or use any additional data structures.
This coding problem is frequently asked during Onsite at Zillow. The interviewer is testing your ability to translate a problem into clean, working code while discussing time and space complexity. Zillow expects candidates to write production-quality code, not just solve the puzzle.
What the Interviewer Expects
- Recognize the underlying problem pattern (sliding window, two pointers, BFS/DFS, etc.)
- Discuss multiple approaches and trade-offs before coding
- Implement an optimal solution with clean, production-quality code
- Handle all edge cases including boundary conditions and invalid input
- Optimize both time and space complexity with clear justification
- Test your solution systematically with well-chosen examples
Key Topics to Cover
How to Approach This
- Clarify input constraints and edge cases before writing code.
- Walk through your approach verbally and confirm with the interviewer before coding.
- Start with a brute force solution, then optimize. Mention time and space complexity.
- Test your solution with examples, including edge cases like empty input or duplicates.
- Consider common patterns: sliding window, two pointers, hash map, BFS/DFS, dynamic programming.
Possible Follow-up Questions
- What happens if the input contains duplicates?
- Can you solve this iteratively instead of recursively (or vice versa)?
- What if the input doesn't fit in memory?
Sharpen Your Skills on Codemia
Practice similar problems with our interactive workspace, get AI feedback, and track your progress.
Practice DSA ProblemsSample Answer
Problem Analysis
The problem requires us to perform a binary search on a sorted singly linked list for a target value. The conventional binary search algorithm relies on random access to elements via indices, which is...
Approach
- Initialize Two Pointers: Start with two pointers,
startandend, representing the beginning and the end of the linked list. - Find the Middle: To mimic the binary search's divide and c...
Submit Your Answer
