📜Day 99 of #gfg160 .Solved “Parenthesis Checker” today! ✅.Used a stack to validate balanced brackets in a string – loved how clean & efficient it feels for such problems!.Thanks @geeksforgeeks 💚.#DSA #Stack #Java #geekstreak2025 #100DaysOfCode

📜Day 98 of #gfg160 .Solved “Find Median in a Stream” today! ✅.Used two heaps (Max + Min) to dynamically track the median as numbers streamed in 📊.Loved how #PriorityQueue simplifies this in #Java 💡.Thanks @geeksforgeeks 💚.#DSA #Heap #Stream #geekstreak2025

📜Day 97 of #gfg160 .Solved “Merge K Sorted Linked Lists” today! ✅.Used Min Heap to efficiently combine K sorted linked lists into one 🔗.Loved how #PriorityQueue helps in optimizing merge ops! 🧠.Thanks @geeksforgeeks 💚.#DSA #LinkedList #Heap #Java #geekstreak2025

📜Day 96 of #gfg160 .Solved “K Closest Points to Origin” today! ✅.Used Max Heap to track the k nearest points using Euclidean distance 📍.Great application of PriorityQueue!.Thanks @geeksforgeeks 💚.#DSA #Heap #Geometry #Java #geekstreak2025 #Arrays

📜Day 95 of #gfg160 .Solved “K Largest Elements” today! ✅.Learned how to use Min Heap to efficiently track top-k elements in an array 🔢.Great practice for priority queues & optimization!.Thanks @geeksforgeeks 💚.#DSA #Heap #Arrays #geekstreak2025 #Java

📜Day 94 of #gfg160 .Solved “Serialize and Deserialize a Binary Tree” today! ✅.Learned how to encode tree structure into an array & rebuild it using BFS 🌳.Great for understanding tree reconstruction!.Thanks @geeksforgeeks 💚.#DSA #BinaryTree #Serialization #geekstreak2025

📜Day 93 of #gfg160 .Solved “Lowest Common Ancestor in a BST” today! ✅.Used BST properties to locate the LCA efficiently in O(h) ⏱️.A classic DSA gem that sharpens tree thinking 🌳.Thanks @geeksforgeeks 💚.#DSA #BinarySearchTree #LCA #geekstreak2025

📜Day 92 of #gfg160 .Solved “Fixing Two nodes of a BST” today! ✅.Used inorder traversal to detect misplaced nodes 💡.Swapped back the corrupted pair without changing tree structure 🌳.Hard one but satisfying!.Thanks @geeksforgeeks 💚.#DSA #BinarySearchTree #geekstreak2025

📜Day 91 of #gfg160 .Solved “Pair Sum in BST” today! ✅.Used DFS + HashSet to catch complements in real-time! 🎯.Classic BST + hashing combo 💡.Edge case: No such pair? Return false. Thanks @geeksforgeeks 💚.#DSA #BinarySearchTree #geekstreak2025

📜Day 90 of #gfg160 .Solved “k-th Smallest in BST” today! ✅.Used in-order DFS to fetch elements in sorted order and grabbed the k-th one. 🌿.Classic BST property in action!.Edge case: k > node count → return -1. Thanks @geeksforgeeks 💚.#DSA #geekstreak2025 #BinarySearchTree

📜Day 89 of #gfg160 .Solved “Check for BST” today! ✅.Used DFS with value range validation (min < node < max) to ensure left < root < right across all nodes. 🌳.No duplicates allowed = extra care!.Fun and crisp problem!.Thanks @geeksforgeeks 💚.#DSA #geekstreak2025 #BinaryTree

📜Day 88 of #gfg160 .Solved the K Sum Paths in a Binary Tree today! 🌳.Leveraged DFS + prefix sum hashmaps to efficiently count downward-only paths summing to k. Loved the challenge of handling all subpaths, not just root-based ones!.Thanks @geeksforgeeks 💚.#DSA #geekstreak2025

📜Day 87 of #gfg160 .Tackled the Maximum Path Sum from Any Node in a Binary Tree today! 🌲.Used post-order traversal + global max tracking to crack it. Loved the twist where the path doesn’t need to start or end at root!.Thanks @geeksforgeeks 💚.#DSA #Java #geekstreak2025

📜Day 86 of #gfg160 .Explored Boundary Traversal of a Binary Tree today! 🌳.Covered left boundary ➡️ leaves ➡️ reversed right boundary. Learned how to skip duplicates & handle edge cases. Thanks @geeksforgeeks 💚.#DSA #BinaryTree #geekstreak2025 #TreeTraversal #Java

📜Day 85 of #gfg160 .Tackled Inorder Traversal of a Binary Tree today! 🌳.Used both recursion & Morris Traversal for O(1) space. Solidified the LNR traversal logic 💡.Simple problem, powerful concept!.Thanks @geeksforgeeks 💚.#DSA #BinaryTree #Recursion #geekstreak2025

📜Day 84 of #gfg160 .Built a Binary Tree from Inorder & Preorder arrays today!🌿.Used recursive DFS with HashMap for efficient lookups. Output in postorder traversal 🧠.Challenging but super satisfying!.Thanks @geeksforgeeks 💚.#DSA #BinaryTree #Recursion #geekstreak2025

📜Day 83 of #gfg160 .Tackled Mirror Tree today!.Used a simple recursive post-order DFS to swap left & right at every node—clean, elegant, and efficient. 🪞🌳.Binary trees feel less intimidating with each day!.Thanks @geeksforgeeks 💚.#DSA #BinaryTree #Recursion #geekstreak2025

📜Day 82 of #gfg160 .Cracked Diameter of a Binary Tree today! 🌐.Used post-order DFS to track heights & update max path length (in edges) between any two nodes. Recursive + efficient!.Feels great to see things connect!.Thanks @geeksforgeeks 💚.#DSA #BinaryTree #geekstreak2025

📜 Day 81 of #gfg160 .Tackled Height of Binary Tree today! 🌲.Used recursion to dive deep from root to leaf & count the longest path in edges. Simple, clean & elegant DFS-style. 🔁.Loving the momentum!.Thanks @geeksforgeeks 💚.#DSA #BinaryTree #DFS #geekstreak2025

📜 Day 80 of #gfg160 .Cracked Level Order Traversal today 🌳.Used BFS with a queue to traverse level by level — clean, structured, and efficient! 🔁.A great breather after yesterday’s DFS grind 😄.Thanks @geeksforgeeks 💚.#DSA #BFS #BinaryTree #geekstreak2025