Just received this awesome Kotlin Multiplatform Contest T-shirt from @jetbrains !.Honored to be among the selected participants 🎉.Big thanks to the @kotlinconf team.Special shoutout to @Belosnegova for the smooth delivery! 🙌.#Kotlin #KotlinConf2025 #JetBrains #AndroidDev

🎉 Challenge Completed! 🎉.I finally received my reward bag from #gfg160 by @geeksforgeeks! This journey was all about dedication, growth, and pushing boundaries in my coding skills. Remember: Consistency is key! Keep coding, keep growing. 🚀💻. #GeeksForGeeks #gfg160

Day 98: Stock Span Problem ✅.Use monotonic stack to efficiently find the stock span for each day. @geeksforgeeks . #gfg160 #GeeksForGeeks

Day 97: Next Greater Element ✅.Use monotonic stack to find the next greater element for each number in O(N). @geeksforgeeks . #gfg160 #GeeksForGeeks

Day 96: Longest Valid Parentheses ✅.Use stack to track valid parentheses and find the longest length. @geeksforgeeks . #gfg160 #GeeksForGeeks 🚀

Day 95: Parenthesis Checker ✅.Use a stack to match brackets. If all pairs are valid, it's balanced; otherwise, it's not. @geeksforgeeks . #gfg160 #GeeksForGeeks 🚀

Day 94: Solved Find Median in a Stream 🔢. @geeksforgeeks .#gfg160 #GeeksForGeeks

Finally received my #gfg160 reward confirmation from @geeksforgeeks! 🏆💚

Day 93: Solved Merge K Sorted Linked Lists 🔗✨. Used Min-Heap (Priority Queue) to efficiently merge K sorted linked lists into a single sorted list. @geeksforgeeks . #gfg160 #GeeksForGeeks

Day 92: Solved K Closest Points to Origin 📍✨. Used Max-Heap (Priority Queue) to efficiently find the K closest points to the origin based on Euclidean distance. @geeksforgeeks . #gfg160 #GeeksForGeeks

Day 91: Solved K Largest Elements 🔢🔥. Learned how to efficiently find the K largest elements in an array using a Min-Heap (Priority Queue) for optimal performance. @geeksforgeeks . #PriorityQueue #gfg160 #GeeksForGeeks

Day 90: Solved Serialize and Deserialize a Binary Tree 🌳📜🔄. Learned how to efficiently convert a tree into a string (serialization) and reconstruct it back (deserialization) using BFS (Level Order Traversal). @geeksforgeeks . #gfg160 #GeeksForGeeks

Day 89: Solved Lowest Common Ancestor in a BST 🌳.Used recursive & iterative approaches to find the LCA efficiently. Key learning: Binary Search Tree properties help in optimizing the search. @geeksforgeeks . #LCA #gfg160 #GeeksForGeeks

Day 88: Solved Fixing Two Nodes of a BST 🌳🔄. Identified the misplaced nodes using inorder traversal and corrected them to restore the BST. Key learning: Morris traversal for in-order without extra space. @geeksforgeeks . #BSTFix #gfg160 #GeeksForGeeks

Day 87: Solved Pair Sum in BST 🌳➕🔢. Used inorder traversal & two-pointer technique to efficiently find if a pair exists with the given sum in a Binary Search Tree. @geeksforgeeks . #PairSum #gfg160 #GeeksForGeeks

Day 86: Today, I solved K-th Smallest in BST 🌳🔢. Used inorder traversal to efficiently find the k-th smallest element in a Binary Search Tree. @geeksforgeeks . #KthSmallest #gfg160 #GeeksForGeeks

Day 85: Today, I solved Check for BST 🌳✅. Implemented an efficient approach using inorder traversal to verify if a given binary tree satisfies the BST properties. @geeksforgeeks . #BST #gfg160 #GeeksForGeeks

Day 84: Today, I solved K Sum Paths 🔥🌳. Learned how to find all paths in a binary tree where the sum of nodes equals K. Used prefix sum and DFS for efficient traversal and sum calculation. @geeksforgeeks . #PrefixSum #gfg160 #GeeksForGeeks

Day 83: Today, I solved Maximum Path Sum from Any Node 🔥.Learned how to find the maximum sum path in a binary tree, considering any node as the starting point. Used DFS and recursion to track max contributions from left and right subtrees. @geeksforgeeks .#gfg160 #GeeksForGeeks

Day 82: Today, I solved Tree Boundary Traversal 🌳🔄. Learned how to traverse the left boundary, leaf nodes, and right boundary in reverse order to get the full boundary of a binary tree. @geeksforgeeks . #gfg160 #GeeksForGeeks