Day 111 of #gfg160 ✅. Built the Longest Word Chain, where each word is a predecessor (1-char insertion away). Sorted by length, used DP + HashMap to track best chain length ending at each word. Clean, clever, and efficient!. #Java #DP #DSA #geekstreak2025 #GeeksForGeeks

Day 110 of #gfg160 ✅. Solved the classic Longest Increasing Subsequence (LIS) problem using dynamic programming (O(n²)). Key idea: For each element, check all previous elements to build LIS ending there. #Java #DP #LIS #DSA #100DaysOfCode #geekstreak2025 #GeeksForGeeks

Day 109 of #gfg160 ✅. Solved the longest subarray with bounded diff ≤ x using a sliding window + 2 deques for real-time min/max. Clean O(n) solution with strong window logic!. #Java #DSA #SlidingWindow #MonotonicQueue #geekstreak2025 #GeeksForGeeks #100DaysOfCode

Day 108 of #gfg160 ✅. Solved the classic "max of all subarrays of size k" problem using a deque for optimal O(n) time. Efficient window sliding beats brute force every time!. #Java #SlidingWindow #DSA #CodingChallenge #geekstreak2025 #GeeksForGeeks #100DaysOfCode

Day 107 of #gfg160 ✅. Solved a string decoding problem of the format k[encodedString] using stacks. Handled nested structures and repeat logic cleanly in Java. Another day, another layer of logic mastered!. #Java #DSA #StringParsing #100DaysOfCode #geekstreak2025 #GeeksForGeeks

Day 106 of #gfg160 ✅. Solved an RPN (Reverse Polish Notation) expression evaluation problem using a clean stack-based approach. One step closer to mastering stacks and expressions! 💪. #Java #DSA #100DaysOfCode #CodingChallenge #Postfix #geekstreak2025 #geeksforgeeks

🧠 Day 105 of #gfg160. ✅ Built a Stack with O(1) getMin().🔸 Used a second stack to track current mins.🔸 Sync both on push/pop.This is how you design for time efficiency!.#Java #DSA #Stack #ProblemSolving #geekstreak2025

💡 Day 104 of #gfg160.Solved: Max of Min for Every Window Size.🔹 Used NSL + NSR to find window sizes.🔹 Greedily recorded max of mins.🔹 Stack-based O(n) approach. Tough, but a beautiful application of monotonic stack logic!.#DSA #Java #CodingChallenge #geekstreak2025

📊 Day 103 of #gfg160.Solved: Largest Rectangle in Histogram.🔹 Used monotonic stack.🔹 Tracked heights & widths efficiently.🔹 Final solution in O(n). This is where stacks shine in reducing complexity! 💪.#DSA #Java #StackProblems #geekstreak2025

📈 Day 102 of #gfg160.Solved: Stock Span Problem.🔹 Used monotonic stack.🔹 Found span of days with lower/equal prices.🔹 O(n) solution – clean & efficient. Stacks make problems like these elegant to solve 💡.#DSA #Java #StackProblem #geekstreak2025

📈 Day 101 of #gfg160. Solved: Next Greater Element.➤ Used monotonic stack.➤ Right-to-left traversal.➤ Reversed final result.O(n) solution for a classic problem 💡.#Java #DSA #Stack #ProblemSolving #geekstreak2025

💯 Day 100 of #gfg160. Solved: Longest Valid Parentheses.➤ Used stack to track unmatched indices.➤ Found max length of valid () substrings.100 days of code. Let’s keep building 💻.#DSA #Java #Stack #100DaysOfCode #geekstreak2025

✅ Day 99 of #gfg160. Solved: Valid Parentheses.Used a stack to verify proper closing of (), {}, []. Covers order + type matching. Stack power 💪.#DSA #Java #Stack #100DaysOfCode #geekstreak2025

📊 Day 98 of #gfg160. Solved: Median in a Stream.Used 2 heaps to dynamically track median as input flows in. Max-Heap + Min-Heap = O(log n) efficiency 🔥.#DSA #Java #Heaps #StreamingData #100DaysOfCode #geekstreak2025

✅ Day 97 of #gfg160. Solved: Merge K Sorted Linked Lists.Used a Min-Heap to smartly pick smallest nodes & build one sorted list. Efficient & clean 💡.Time Complexity: O(N log K). #DSA #Java #100DaysOfCode #Coding #geekstreak2025

Oops, forgot to post — but I hit Day 80 of #gfg160 a few days back! 😅.The grind didn’t stop, just the update did. ✔️ Trees.✔️ Recursion.✔️ Graphs.✔️ Backtracking.✔️ Consistency ✅. Pumped for the last 80 days! Let’s gooo 🚀.#geekstreak2025 #DSA #Java

🧠 Day 96 of #gfg160.📍Task: Return k closest points to origin (0,0).✅ Max-Heap based on distance.✔️ Keep top k closest.✔️ Skip sqrt for perf: use x²+y².✔️ PriorityQueue in Java. #Java #DSA #CodingChallenge #geekstreak2025

📈 Day 95 of #gfg160.Task: Return k largest elements from an array in descending order. ✅ Min-Heap to the rescue!.✔️ Add first k elements.✔️ Replace min if larger found.✔️ Reverse sort the heap. #Java #DSA #Heaps #100DaysOfCode #geekstreak2025

🌳 Day 94 of #gfg160.📦 Task: Serialize and Deserialize a Binary Tree.✔️ Level-order traversal.✔️ Store nulls as -1.✔️ Rebuild using a queue. Making trees travel across systems!.#Java #DSA #BinaryTree #100DaysOfCode #geekstreak2025

🌳 Day 93 of #gfg160.Today’s problem: Find LCA of 2 nodes in a BST.✔️ If both < root → LCA on left.✔️ If both > root → LCA on right.✔️ Else → current is LCA. Leverage BST's structure smartly 🔥.#dsa #bst #javacoding #100DaysOfCode #geekstreak2025