🚀Excited about my dynamic programming journey:
▶️started with Fibonacci (easy!), then
▶️House Robber (not so easy), and Painting Fence (not easy at all).
Learning one challenge at a time! #DynamicProgramming 🚀💡🎨
Day --> 33 of #100xdsa
Question solved --> 4
1️⃣Predecessor and Successor of BST (Medium)
2️⃣1008. Construct Binary Search Tree from Preorder Traversal (Medium)
3️⃣Brothers From Different Roots (easy)
4️⃣Median of BST (easy)
#365daysofcode#365daychallenge#dsa#dsachallenge
🚀 Day 26 of #100xDsa 💻
Solving LeetCode 987: Vertical Order Traversal of a Binary Tree.
#approach :
〉Utilize a map to store nodes by column and row. Perform level order traversal with a queue. Update positions, construct traversal from map.
#LeetCode#Coding#DataStructures