📏 Day 201/365 #365DaysOfCode ✅ 🔥 Solved Longest Bitonic Subsequence 🎯 @geeksforgeeks ⏱️ T.C: O(n²) | 💾 S.C: O(n) 💡 Key Insight: bitonic[i] = LIS[i] + LDS[i] - 1 #DynamicProgramming #Algorithms #ProblemSolving #DSA #CPP #100DaysOfCode #LeetCode #InterviewPrep #Striver

📏 Day 201/365 #365DaysOfCode ✅ 🔥 Solved Longest Bitonic Subsequence 🎯 @geeksforgeeks ⏱️ T.C: O(n²) | 💾 S.C: O(n) 💡 Key Insight: bitonic[i] = LIS[i] + LDS[i] - 1 #DynamicProgramming #Algorithms #ProblemSolving #DSA #CPP #100DaysOfCode #LeetCode #InterviewPrep #Striver

⛽ Day 200/365 #365DaysOfCode ✅ 🔥 Solved " Gas Station " ⚡ Approach: 👉 Track total ⛽ & current tank 👉 If tank < 0 → reset start point 👉 Greedy ensures ✅ unique solution ⏱️ T.C: O(n) | 💾 S.C: O(1) #Greedy #DSA #LeetCode #ProblemSolving #CodingJourney #InterviewPrep

📅 Day 199/365 #365DaysOfCode ✅ 💹 Best Time to Buy & Sell Stock III 👉 At most 2 transactions 💰 ⚡ Approach: 🔹 DP + Recursion + Memoization 📚 ⏱️ T.C: O(n · k · 2) 💾 S.C: O(n · k · 2) #LeetCode #striver #DynamicProgramming #Algorithms #ProblemSolving #InterviewPrep

🚀 Day 197/365 #365DaysOfCode 🚀 💹 Solved : Best Time to Buy & Sell Stock II 📊 ⚡ Approach: 🔹 Greedy → Add profit whenever prices[i] > prices[i-1] 🧮 🔹 Accumulate all upward moves 💹 ⏱️ T.C: O(n) | 💾 S.C: O(1) #LeetCode #Greedy #DSA #CPP #CodingChallenge #algorithms

🚀 Day 1 of Web Dev Journey! Today I explored HTML <textarea> 📝 — rows📏, cols📐, maxlength🔢, readonly🔒 & required⚡. Excited to keep leveling up 💻✨ #WebDev #HTML #100DaysOfCode

🧩 Day 195/365 #365DaysOfCode ✅ 🔥 Solved "Shortest Common Supersequence"! ⚡ Approach: DP tabulation ⏱️ T.C: O(mn) | 💾 S.C: O(mn) 💡 Key Insight: Build from LCS → Add non-matching chars from both strings! #DSA #DynamicProgramming #Strings #Algorithms #striver

✨ Day 194/365 #365DaysOfCode 🧩 Solved "Longest Palindromic Subsequence" on #GeeksforGeeks 🔥 💡 Approach: Dynamic Programming + Memoization 👉 Trick: Reduce it to LCS(s, reverse(s)) ⏱️ T.C → O(n²) 💾 S.C → O(n²) #DSA #gfg #ProblemSolving #learnInPublic #programming

🔍 Day 192/365 #365DaysOfCode ✅ 🔥 Solved "Longest Common Substring"! #geeksforgeeks ⚡ Approach: DP Tabulation ⏱️ T.C: O(mn) | 💾 S.C: O(mn) 💡 Key Insight: Match found? ➕1 to prev diagonal value ↗️ No match? Reset to 0 ❌ #DSA #DynamicProgramming #Strings #Algorithms

📏 Day 191/365 #365DaysOfCode ✅ 🔥 Solved Longest Common Subsequence! ⚡ Approach: DP + Memoization ⏱️ T.C: O(mn) | 💾 S.C: O(mn) 💡 Key Insight: ✔️ match → 1️⃣ + ↖️ ❌ no match → ⬆️ or ⬅️ #DSA #DynamicProgramming #Algorithms #ProblemSolving #Coding #InterviewPrep #Tech

🚀 Day 189/365 #365DaysOfCode 💻 Today I cracked “Coin Change (Count Ways)” on #GeeksforGeeks 🎯 🔍 Used DP + Memoization to count ways to form a sum with infinite coins 💰 ⏱ T.C : O(nsum) 💾 S.C : O(nsum) #DSA #ProblemSolving #LearnInPublic #Striver #algorithm #matrix

🪙 Day 188/365 #365DaysOfCode ✅ 🔥 Solved "Coin Change " on #GeeksforGeeks ⚡ Approach: DP + Memoization ⏱️ T.C → O(n*sum) 💾 S.C → O(n*sum) 🎯 Learned how to minimize coins to reach target sum efficiently 🚀 #DSA #gfg #ProblemSolving #learnInPublic #striver #DP

🔄 Day 187/365 #365DaysOfCode ✅ 🔥 Solved : Merge Sorted Array! ⚡ Approach: Three Pointers (Backward) ⏱️ T.C: O(m+n) 💾 S.C: O(m+n) 💡 Key Insight: Merge backwards to avoid overwriting! #DSA #MergeSort #TwoPointers #algorithms #LeetCode #ProblemSolving

Day 181/365 #365DaysOfCode ✅ 🔥 Solved Minimum Subset Sum Difference! ⚡ Approach: DP Memoization ⏱️ T.C: O(n*sum) | 💾 S.C: O(n*sum) #DSA #DynamicProgramming #PartitionProblem #StriversDPSeries #StriverDP #Coding #Optimization

Day 184/365 #365DaysOfCode ✅ 🔥 Solved Minimum Subset Sum Difference! ⚡ Approach: DP Memoization ⏱️ T.C: O(n*sum) | 💾 S.C: O(n*sum) #DSA #DynamicProgramming #PartitionProblem #StriversDPSeries #StriverDP #Coding #Optimization

⚖️ Day 183/365 #365DaysOfCode ✅ 🔥 Solved Partition Equal Subset Sum with #DynamicProgramming 💻 ⚡ Approach: Memoization ⏱️ T.C: O(n*sum) 💾 S.C: O(n*sum) #DSA #DP #PartitionProblem #ProblemSolving #striver #geeksforgeeks #algorithm #LearnInPublic

⚖️ Day 184/365 #365DaysOfCode ✅ 🔥 Solved Partition Equal Subset Sum with #DynamicProgramming 💻 ⚡ Approach: Memoization ⏱️ T.C: O(n*sum) 💾 S.C: O(n*sum) #DSA #DP #PartitionProblem #ProblemSolving #striver #geeksforgeeks #algorithm #LearnInPublic

🔢 Day 183/365 #365DaysOfCode ✅ 🔥 Solved Minimize Max Pair Sum! ⚡ Approach: Sorting + Two Pointers ⏱️ T.C: O(n log n) | 💾 S.C: O(1) 💡 Key Insight: Pair smallest with largest → balance sums #DSA #Greedy #Sorting #Algorithms #ProblemSolving #LeetCode #LearnInPublic

🔢 Day 183/365 #365DaysOfCode ✅ 🔥 Solved Minimize Max Pair Sum! ⚡ Approach: Sorting + Two Pointers ⏱️ T.C: O(n log n) | 💾 S.C: O(1) 💡 Key Insight: Pair smallest with largest → balance sums #DSA #Greedy #Sorting #Algorithms #ProblemSolving #LeetCode #LearnInPublic

⚔️ Day 182/365 #365DaysOfCode✅ 🔥 Solved "Tymin's War Strategy"! #geeksforgeeks Approach: Greedy + Sorting ⏱️ T.C:O(n log n) 💾 S.C:O(n) 💡 Key Insight: Sort by soldiers needed → fill smallest first #DSA #Greedy #LearnInPublic #ProblemSolving #algorithm