LeetCode
Experience
#270 Closest Binary Search Tree Value
Interview Experience
LeetCode #270: Closest Binary Search Tree Value. Difficulty: Easy. Topics: Binary Search, Tree, Depth-First Search, Binary Search Tree, Binary Tree. Asked at Meta in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →Topics
Binary Search Tree
Binary Tree
Depth-First Search
Tree
Binary Search
Binary Tree
Graph
More from Meta
Reddit
Leetcode is cooked in 2026 and we don't hire people who only grind leetcode.
Reddit
Returning to SWE work after 3 years of cancer treatment
Reddit
2026 New Grad Recap
Reddit
Most likely failed meta phone screen
Reddit
Targeting OpenAI SWE Roles? Insights on what to expect from recent system design loops