🚀 LeetCode 987 - Vertical Order Traversal
✔️ Built tree from inorder and preorder
✔️ Nailed vertical grouping with row and value sort
✔️ Solved range query problems
Feeling sharper with every node 💪 #LeetCodeHard#BinaryTree#DSAinJava#CodingJourney#100DaysOfCode
Max on the left, Min on the right
Heaps keep it lean like code in flight
Store running sums, no brute in sight
Slide through the middle with logic tight
Balance the halves, get that diff just right
#DevLife#DSA#leetcodehard
Solved a twist on the classic "Add Two Numbers" problem today! 🔢
Digits were in normal order (MSD first), so I used Stacks to simulate reverse addition. 🚀
Input: [7,2,4,3] [5,6,4]
Output: [7,8,0,7] 💥
#LeetCode#Java#DSA#Day1#100DaysOfCode#CodingChallenge#LeetcodeHard
day 11 of #100DaysOfCode
✅ Solved a hard DP problem: "Find the Original Typed String II"
🧠 Used run-length encoding knapsack-style DP with state capping
📈 Optimized with difference array
🎯 Passed all test cases efficiently (O(n m·k))!
#Python#DP#LeetcodeHard