Question Details
LeetCode #1483: Kth Ancestor of a Tree Node. Difficulty: Hard. Topics: Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Breadth-First Search, Design. Asked at Google 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
Breadth-First Search
Depth-First Search
Design
Tree
Binary Search
Bit Manipulation
Dynamic Programming
Graph