Path Sum II (LeetCode 113)
MediumLeetCode 113 · Root-to-Leaf Paths · Google, Amazon +8 · 12:38Path Sum II · Bloomberg · LinkedIn · Amazon · Bloomberg · Quora · Leetcode 113My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 113 Path Sum II by codestorywithMIK: Trees, Medium. Topics: Backtracking, Tree, Depth-First Search, Binary Tree. Watch the explanation, then check the code and solve it on LeetCode.
- Problem
- LeetCode 113: Path Sum II
- Difficulty
- medium
- Topics
- Backtracking, Tree, Depth-First Search, Binary Tree
- Patterns
- Root-to-Leaf Paths
- Chapter
- Trees
- Duration
- 12:38
Related problems
- Path Sum - (Amazon, Microsoft, Accolite, Adobe...) : Explanation + Live Coding 🧑🏻💻👩🏻💻 (LeetCode 112)
- Binary Tree Maximum Path Sum - (Google, Meta, Amazon, Flipkart) : Explanation ➕ Live Coding (LeetCode 124)
- Sum Root to Leaf Numbers (LeetCode 129)
- Paths from root with a specified sum
- Pseudo-Palindromic Paths in a Binary Tree (LeetCode 1457)
- Sum of Root To Leaf Binary Numbers (LeetCode 1022)