🧮 Day 117 #GFG160 — Count Staircase Ways (Optimized). Solved: Ways to reach n stairs using Matrix Exponentiation.✔ Used Fibonacci logic with T(n) = O(log n).✔ Identity matrix + binary power.✔ Massive speed boost over recursion.@geeksforgeeks.#GeekStreak2025 #DSA #Python

✍️ Day 116 #GFG160 — Edit Distance. Solved: Min operations to convert s1 → s2.✔ Space-optimized 1D DP.✔ Compared chars, allowed insert/delete/replace.✔ Classic O(m×n) solution. @geeksforgeeks #GeekStreak2025 #DSA #Python

🔁 Day 115 #GFG160 — Count Palindromic Substrings. Solved: Counted all substrings with len ≥ 2 that are palindromes.✔ Bottom-up 2D DP.✔ Checked s[i] == s[j] & inner substring.✔ Skipped length 1 by design.@geeksforgeeks.#GeekStreak2025 #DSA #Python #Palindrome

💫 Day 114 #GFG160 — Longest Palindromic Substring. Solved: Found max-length palindrome in a string.✔ Center expansion (odd + even).✔ Checked both directions.✔ Greedy + O(n²) time, O(1) space.@geeksforgeeks.#GeekStreak2025 #DSA #Python #Palindrome ✅

🪞 Day 113 #GFG160 — Longest Palindromic Subsequence. Solved: Max length of a palindromic subsequence.✔ Compared ends: if match → +2.✔ Used 1D space-optimized DP.✔ Classic DP twist on LCS logic.@geeksforgeeks #GeekStreak2025 #DSA #Python #DynamicProgramming ✅

🔁 Day 112 #GFG160 — Longest Common Subsequence. Solved: Find longest shared pattern in 2 strings.✔ Classic DP with 2D table.✔ Compared chars & stored best match.✔ Optimal tabulation, O(m×n) time.@geeksforgeeks.#GeekStreak2025 #DSA #DynamicProgramming #Python ✅

IBM deserves appreciation for their SkillBuild program. I am really impressed with them. Watch this 👇👇👇. @IBM @ibm_in @IBMDeveloper.

📈 Day 110 #GFG160 — Longest Increasing Subsequence. Solved: LIS using DP.✔ Compared each pair i > j.✔ Stored max length at each step.✔ Classic O(n²) tabulation approach. @geeksforgeeks.#GeekStreak2025 #DSA #Python #DynamicProgramming ✅

📏 Day 109 #GFG160 — Longest Subarray with Bounded Diff. Solved: Longest subarray with |max−min| ≤ X.✔ Used 2 deques for min/max tracking.✔ Sliding window with monotonic queue.✔ Optimal: O(n) time.@geeksforgeeks.#GeekStreak2025 #DSA #SlidingWindow #Deque #Python ✅

🧩 Day 107 #GFG160 — Decode Nested Strings. Solved: Decoded "3[b2[ca]]" ➝ "bcacabcacabcaca".✔ Pure string ops, no stack used.✔ Tracked [ to build pattern.✔ Backtracked + repeated efficiently. @geeksforgeeks.#GeekStreak2025 #DSA #Python #String ✅

💥 Day 106 of #GFG160 : Postfix Expression Evaluation.🧱 Stack stores operands.➕ Apply operator on top 2.🧠 Truncate on / to mimic int division. #DSA #GeekStreak2025 @GeeksforGeeks ✅

🚀 #GFG160 — Day 105.Solved: Min Stack in O(1) Time & Space. ✨ Math trick to store previous min.📌 Constant-time push/pop/peek/getMin.🧠 No extra space needed. #DSA #GeekStreak2025 #GFG160 @GeeksforGeeks ✅

🪟 Day 104 #GFG160 – Max of Min for Every Window Size. ✔ Found max of minimums for all window sizes.✔ Used monotonic stack + range mapping.✔ O(n) efficient, handles all subarray sizes.@geeksforgeeks #DSA #Stack #GeekStreak2025 #Python

📊 Day 103 #GFG160 - Lrgst Rect in Histo!. Solv: Max area in histo w/ stack.✔ O(n) time, eff w/ mono stack.✔ All bars as rect bases.✔ Smart width calc.Trick: Store idx, not hts — calc width on fly!.@geeksforgeeks #GeekStreak2025 #DSA #Stacks #Python

📉 Day 102 #GFG160 - Stock Span Problem!. ✔ Used monotonic stack.✔ O(n) time — each index pushed/popped once.✔ Real-world pattern: Stock trend analysis.Key trick: Count consecutive smaller values from left using stack. @geeksforgeeks #GeekStreak2025 #DSA #Stacks #Python

💯 days. 100 problems. 100 solutions. 💻 What I did?. ✅ Built daily consistency.✅ Mastered DSA with patterns.✅ Boosted my problem-solving speed.✅ One step closer to my dream tech role!.📚 This wasn’t just about code. It was about discipline, grit, and growth. @geeksforgeeks.

📈 Day 101 #GFG160 - Next Greater Element!. Solved: Found next greater for each array item.✔ Monotonic stack → fast lookup.✔ O(n) time, single pass.✔ Right-to-left traversal keeps stack sorted. @geeksforgeeks #GeekStreak2025 #DSA #Stack #Python #NextGreater

🥳 Day 100 #GFG160 - Longest Valid Parentheses!. Solved: Found max length of balanced brackets.✔ Two-pointer scan from both sides.✔ Handles extra opening/closing cases.✔ O(n) time, constant space. @geeksforgeeks #GeekStreak2025 #DSA #String #Python #Milestone

🧩 Day 99 #GFG160 - Balanced Parentheses!. Solved: Checked if expression has matching brackets.✔ Stack-based validation.✔ Handles all 3 bracket types.✔ Clean O(n) solution.Key trick: Stack top must match closing bracket type!.@geeksforgeeks #GeekStreak2025 #DSA #Stacks

📊 Day 98 #GFG160 - Median of Running Stream!. Solved: Tracked live medians using two heaps.✔ Max heap + min heap = dynamic balance.✔ O(log n) insertions.✔ Accurate medians at every step. @geeksforgeeks #GeekStreak2025 #DSA #Heaps #Python #MedianInStream