Find shortest distance in binary tree
Last updated: August 8, 2025
Quick Overview
Given a graph, find the median efficiently using Binary Search.
MongoDB
August 8, 20253
15
2,436 solved
Given a graph, find the median efficiently using Binary Search.
This coding problem is frequently asked during Onsite at MongoDB. The interviewer is testing your ability to translate a problem into clean, working code while discussing time and space complexity. MongoDB 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
- How would you modify your solution to handle streaming input?
- How would your solution change if the input was sorted?
- Can you optimize the space complexity of your solution?
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
To find the shortest distance between two nodes in a binary tree, we can utilize a graph traversal technique, specifically Depth-First Search (DFS). This approach is suitable because it allows us to e...
Approach
- Find the LCA: Implement a DFS that returns the LCA of the two target nodes. If the current node is either of the target nodes, return it. If LCA is found in both left and right subtrees, the cu...
Submit Your Answer
