These curated problems are from my leet code, algo expert, freecodecamp practice problem. I might not be shooting for the best solution here but more of the appraoch i enjoyed and worth making a note as i forget the nitty gritty details as days goes on.
Here is the binay tree problems from leetcode. The repo here is seperated into binary-tree, binary-search-tree, nth-tree, graphs and linkedList-to-binary-tree to seperate the topics and focus on the common patterns.
- 112. Path Sum
- 113. Path Sum II
- 124. Binary Tree Maximum Path Sum
- 257. Binary Tree Paths
- 437. Path Sum III
- 235. Lowest Common Ancestor of a Binary Search Tree
- 236. Lowest Common Ancestor of a Binary Tree
- 1644. Lowest Common Ancestor of a Binary Tree II
- 1650. Lowest Common Ancestor of a Binary Tree III
- 1676. Lowest Common Ancestor of a Binary Tree IV
- 2096. Directions From Start to Destination nodes ( i.e UP LEFT RIGHT DOWN )
- 1740. Find Distance in a Binary Tree ( i.e START and DESTINATION )
- 1257. Smallest Common Region
- 102. Binary Tree Level Order Traversal
- 104. Maximum Depth of Binary Tree (level order)
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 3. Longest Substring Without Repeating Characters
- 26. Remove Duplicates from Sorted Array
- 27. Remove Element