Path Sum II | company tag : Amazon , Google, Facebook | leetcode 113 | Python



Channel Description ??‍?

Well, I am on a mission to create a repository for most asked interview questions by creating this YT channel AND solve them.

———-problem description ?? —————–

Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.

Note: A leaf is a node with no children.

Example:

Given the below binary tree and sum = 22,

5
/
4 8
/ /
11 13 4
/ /
7 2 5 …

Related Posts

Leave a Reply

Your email address will not be published.

© 2022 Code As Pro - Theme by WPEnjoy · Powered by WordPress