Pseudo-Palindromic Paths in a Binary Tree (LeetCode 1457)
MediumLeetCode 1457 · Root-to-Leaf Paths · Amazon · 26:41Pseudo-Palindromic Paths in a Binary Tree · 2 Ways · Bit Magic · Leetcode 1457My 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 1457 Pseudo-Palindromic Paths in a Binary Tree by codestorywithMIK: Trees, Medium. Topics: Bit Manipulation, Tree, Depth-First Search, Breadth-First Search. Watch the explanation, then check the code and solve it on LeetCode.
Related problems
- Path Sum II (LeetCode 113)
- 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
- Sum of Root To Leaf Binary Numbers (LeetCode 1022)