The rarest of all human qualities is consistency. 🫰.

🟡 Day 10 of #POTDwithGFG – Digging Through the DP Gold Mine!.📌 Problem: Max Gold Collection in a Grid with Diagonal Moves.⛏️ Used bottom-up DP from right to left — because sometimes, gold lies in looking back. #Day10 #100DaysOfCode #DynamicProgramming @geeksforgeeks

Day 114 ✅ | #gfg160 Challenge @geeksforgeeks.📌 Problem: Longest Palindrome in a String.🧠 Approach: Dynamic Programming (Bottom-Up).🔁 Checked all substrings and tracked the longest palindrome. #Python #DynamicProgramming #Palindrome #100DaysOfCode #gfgPractice #geekstreak2025

RT @geeksforgeeks: Code is like poetry . Some get it, some don’t. Those who don’t get it, are confused . Those who get it, are even more co….

🟢 Day 9 of #POTDwithGFG.📌 Problem: Count binary strings with at least one pair of consecutive 1s.📈 Used DP to count strings without consecutive 1s — then subtracted from total. #Day9 #GFGPOTD #100DaysOfCode #DynamicProgramming #DSADaily #ConsistencyInCode.@geeksforgeeks

Day 113 ✅ | #gfg160 Challenge.@geeksforgeeks.📌 Problem: Longest Palindromic Subsequence.🧠 Approach: Using Tabulation.Used two 1D arrays to reduce space while comparing substrings in Reverse. 📈 T: O(n²) | S: O(n). #Python #DynamicProgramming #LPS #100DaysOfCode #gfgPractice

🟢 Day 8 of GFG POTD .📌 Problem: Find the Longest Word with All Prefixes Present.🚀 Result: Simple logic, powerful outcome — another one done!. #Day8 #GFGPOTD #100DaysOfCode #DSADaily #PrefixGame #PythonSolutions @geeksforgeeks

Day 112 ✅ | #gfg160 Challenge @geeksforgeeks.📌 Problem: Longest Common Subsequence. 💻 Solved: Using Bottom-Up DP with a 2D table.📈 T: O(n·m) | S: O(n·m). #Python #DynamicProgramming #LCS #100DaysOfCode #gfgChallenge

🟢 Day 7 of #GFG POTD.📌 Problem: Sum of Minimum Elements of All Subarrays.✅ Used monotonic stack to calculate how many subarrays each element is the minimum of.📱 Solved with clean O(n) logic — consistency leveling up!. #Day7 #GFGPOTD #100DaysOfCode #DSAMastery @geeksforgeeks

Day 111 ✅ | #gfg160 Challenge @geeksforgeeks.🔗 Problem: Longest String Chain.🧠 Approach: DP + Deletion-based predecessor check. #Python #DP #StringChain #100DaysOfCode #geekstreak2025 #gfgChallenge

🟢 Day 6 of #GFG POTD .📌 Problem: Next Greater Frequency Element to the Right.🛣️ Solved it on the phone while traveling – no excuses, just DSA!.📈 Applied frequency mapping + monotonic stack to track elements. #Day6 #GFGPOTD #100DaysOfCode #DSAonTheGo

Day 110 ✅ | #gfg160 Challenge @geeksforgeeks.📱 Solved: LIS — on phone while traveling!.🎯 Goal: Find the length of the longest strictly increasing subsequence. 📈 T: O(n log n) | S: O(n) using Binary Search. 👇 More in ALT. #Python #DSA #100DaysOfCode #GeekStreak2025

🟢 Day 5 of #GFG POTD .📌 Problem: Next Greater Element in Circular Array.🔁 Circular arrays meet classic monotonic stack magic.💡 Learned how to simulate circular behavior with 2*n loop. #Day5 #GFGPOTD #100DaysOfCode #StackProblem #NextGreaterElement #DSAChallenge

Day 109 ✅ | #gfg160 Challenge @geeksforgeeks.🔁 Solved: Longest Bounded-Difference Subarray.🎯 Goal: Find the longest subarray where the difference between any two elements is ≤ x. 📈 T: O(n) | S: O(n).👇 More in ALT. #Python #DSA #100DaysOfCode #GeekStreak2025

RT @geeksforgeeks: It’s tough. But you’re tougher.

🟢 Day 4 of #GFG POTD Challenge.📌 Problem: Maximum Sum Combination.🧠 Concept Used: Max Heap + Sorting + Visited Set.✅ Learned how to smartly fetch the top K max pairs from two arrays. #Day4 #GFGPOTD #DSAChallenge #100DaysOfCode #HeapMagic #PythonCoding

Day 108 ✅ | #gfg160 Challenge @geeksforgeeks.🔁 Solved: K Sized Subarray Maximum.🎯 Goal: Find the maximum in each subarray of size k. 📈 T: O(n) | S: O(k).👇 More in ALT. #Python #DSA #100DaysOfCode #GeekStreak2025 #SlidingWindow #Deque

🟢 Day 3 of GFG POTD Challenge – Tested & Conquered!.📌 Problem: Max Score from Subarray Mins.⛔ Faced multiple TLEs and logical roadblocks.✅ Finally cracked it using previous & next smaller element strategy (O(n)). #Day3 #GFGPOTD #DSAChallenge @geeksforgeeks

Day 107 ✅ | #gfg160 Challenge @geeksforgeeks.🔁 Solved: Decode the String.🎯 Goal: Decode strings of the form k[encodedString] where the substring is repeated k times. 📈 T: O(n) | S: O(n).👇 More in ALt. #Python #DSA #100DaysOfCode #GeekStreak2025

🟢 Day 2 of POTD – Cracked It!.✅ Solved: Subarrays With At Most K Distinct Integers.🧠 Applied Sliding Window + HashMap to count all valid subarrays!.💥 Faced a runtime error (typo!), debugged it, and nailed the logic. #Day2 #GFGPOTD #DSA #100DaysOfCode @geeksforgeeks

Day 106 ✅ | #gfg160 Challenge @geeksforgeeks.🔁 Solved: Postfix Evaluation.🎯 Goal: Evaluate an arithmetic expression in Reverse Polish Notation (Postfix). 🎯 Using Stac. 📈 T: O(n) | S: O(n).👇More in ALT. #Python #DSA #100DaysOfCode #GeekStreak2025 #Stack #PostfixNotation