Day 100/160 – 160 days of Problem Solving 💯 ✅ Solved: Longest Valid Parentheses Balanced every bracket and hit a major milestone! 100 days of logic, learning, and consistency 💪 #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

Day 99/160 – 160 days of Problem Solving ✅ 🧠 Solved: Parenthesis Checker Stacked up some logic to validate every opening and closing bracket perfectly! 1 step away from Day 100 — let’s go! 🚀 #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

Day 98/160 – GeeksforGeeks Problem Solving 📊 ✅ Solved: Find Median in a Stream Balanced two heaps to maintain the median in real-time — streaming data, steady logic! #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

Day 97/160 – 160 days of Problem Solving 🔗 ✅ Solved: Merge K Sorted Linked Lists Min-heap to the rescue! Efficiently merged multiple lists into one cleanly sorted chain. #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

Day 96/160 – 160 days of Problem Solving 📍 ✅ Solved: K Closest Points to Origin Used a priority queue to find the closest points in a 2D plane — distance matters! #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

🔹 Day 95 / 160 🔹 Topic: K Largest Elements | 160 days of problem solving | Digging deep into heaps and selection techniques — because finding the top K matters, in code and in life. 💻✨ #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

🔁 Day 94 of 160 Days of Problem Solving 📌 Topic: Serialize and Deserialize a Binary Tree 📚 Turning trees into strings and back again — because even binary trees deserve some save & load functionality! 🌲💾 #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

Day 93/160 – Lowest Common Ancestor in a BST 🌳 | 160 days of problem solving | From root to leaf, the journey gets clearer—finding common ground one ancestor at a time. #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

Day 92/160 – Fixing Two Nodes of a BST 🔧🌳 | 160 days of problem solving | Today’s bug hunt: two nodes swapped in a BST 😬🔄 Restored order with an in-order trick—because even trees deserve a second chance! 💚 #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

Day 91/160 – Pair Sum in BST 🌳➕🌳 | 160 days of problem solving | Cracked another classic today! 🔍 Found whether a pair with a given sum exists in a Binary Search Tree. Halfway is behind us—onward to mastery! 💪💻 #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

Day 90/160 – K-th Smallest in BST ✅ | 160 days of problem solving | 90 days in, and the grind continues! Today’s challenge: Finding the k-th smallest element in a BST using in-order magic 🌱✨ #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

Day 89/160 – "Check for BST" 🌳✅ | 160 days of problem solving | Cracking into tree validations today! Checked whether a Binary Tree is a Binary Search Tree – structure meets sorted order. #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

🚀 Day 88 of 160 Days of Code | 160 days of problem solving 🔍 Topic: K Sum Paths 📈 Cracking deeper into trees and recursion, one sum at a time. #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

🔥 Day 87/160 – Maximum Path Sum from Any Node | 160 days of problem solving | Digging deep into binary trees to uncover the path that holds the highest value! Every node counts when chasing that maximum sum. #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

🌳 Day 86/160 – Tree Boundary Traversal | 160 days of problem solving | Today’s challenge takes us to the perimeter of binary trees — exploring roots, leaves, and boundaries like true problem-solving pros. #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

Day 85/160 – Inorder We Trust 🌿| 160 days of problem solving | Exploring the left, loving the root, and gliding to the right – today’s all about mastering Inorder Traversal in binary trees! #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

🌳 Day 84 of 160: Construct Tree from Inorder & Preorder | 160 days of problem solving. 🔍 Rebuilding a binary tree from its traversals—because sometimes to move forward, you need to trace the roots! #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

Day 83/160 – 160 days of problem solving | Today’s challenge: Mirror Tree!🌳🔁 Flipping trees like flipping pancakes – left becomes right and right becomes left. #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

Day 82 of 160 – 160 days of problem solving | 🟢 Topic: Diameter of a Binary Tree Solved how to find the longest path in a binary tree using recursion and depth tracking. #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks

"Day 81: Height of Binary Tree 🌲 — another step forward in my 160-day GFG journey. #gfg160 #geekstreak2025 #geeksforgeeks @geeksforgeeks