LeetCode
Experience
#272 Closest Binary Search Tree Value II
Interview Experience
LeetCode #272: Closest Binary Search Tree Value II. Difficulty: Hard. Topics: Two Pointers, Stack, Tree, Depth-First Search, Binary Search Tree, Heap (Priority Queue), Binary Tree. Asked at LinkedIn 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
Heap (Priority Queue)
Stack
Tree
Binary Search
Binary Tree
Graph
Heap
Queue
Stack
Two Pointers
More from LinkedIn
Reddit
UPDATE: HR specialist viewed my linkedin profile after final interview?
Reddit
[Insights, advice, and my experience] Got offers from Zapier, Samsara, and PayPal
Reddit
Correlation to Hiring Manager viewing profile, and made a hire?
Reddit
Rejected from job and then got a request to chat over LinkedIn?
Reddit
What's the vibe?