Path Sum III | LeetCode 437 - You are given a binary tree in which each node contains an integer value - [ Ссылка ]
Find the number of paths that sum to a given value.
Source code - [ Ссылка ]
00:00 Problem Description
01:58 Whiteboarding for approach 1
08:27 Actual code for approach 1
09:53 Time complexity for approach 1
13:10 Whiteboarding for approach 2
20:40 Actual code for approach 2
![](https://i.ytimg.com/vi/uZzvivFkgtM/maxresdefault.jpg)