The day 8 problem in August Leetcoding Challenge. ( Path Sum III ).
Wiki link: [ Ссылка ]
Check out our other popular playlists:
✅✅✅[ July Leetcoding Challenges ] : [ Ссылка ]-
✅✅✅[ Cracking the Coding Interview - Unique String ] : [ Ссылка ]
✅✅✅[ June Leetcoding Challenges ] : [ Ссылка ]
✅✅✅[ May Leetcoding challenges ]: [ Ссылка ]
0:00 Path Sum III Problem Statement
1:00 Brute Force Approach
3:34 Prefix Sum
Problem Link: [ Ссылка ]
Problem statement:
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.
The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to child nodes).
The tree has no more than 1,000 nodes and the values are in the range -1,000,000 to 1,000,000.
Example:
root = [10,5,-3,3,2,null,11,3,-2,null,1], sum = 8
10
/ \
5 -3
/ \ \
3 2 11
/ \ \
3 -2 1
Return 3. The paths that sum to 8 are:
1. 5 - 3
2. 5 - 2 - 1
3. -3 - 11
If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.
Code Link: [ Ссылка ]
#coding #interview #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode
