LeetCode Experience

#113 Path Sum II

Interview Experience

LeetCode #113: Path Sum II. Difficulty: Medium. Topics: Backtracking, Tree, Depth-First Search, Binary Tree. 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

Binary Tree Depth-First Search Tree Backtracking Binary Tree Graph