#dynamicprogramming zoekresultaten

Two paths, one problem. 💧 A greedy stack that flows like water. 📊 A DP table built as an architecture. Both chase the same cost function, but reveal different kinds of beauty in algorithm design. #algorithms #DynamicProgramming #CompetitiveProgramming

Pulling an all-nighter 🌙 Started with DP but decided to brush up recursion first 🔁 #Coding #Recursion #DynamicProgramming #AllNighter #DevLife

Day 97 | Sigma 7.0 | #100DaysOfCode Covered more DP gems 💎 🔹 MCM (Memoization & Tabulation) 🔹 Minimum Partitioning 🔹 Minimum Array Jumps Bit by bit, mastering Dynamic Programming 💪 Thanks @ShradhaKhapra_ Ma’am & @ApnacollegeX 🙏 #DSA #DynamicProgramming #ShradhaKhapra #DP

🚀 Day 77 of my #100DaysOfDSA Today I practiced: ✅ Balanced Parentheses combinations 🧩 ✅ Minimum Partitioning 🔢 ✅ Minimum Partitioning (Zero Difference) ⚖️ ✅ Tribonacci Series 🔺 Slowly mastering DP one problem at a time 💪 #DynamicProgramming #CodingJourney #DSA

Opinion : Learn DP before Graphs. DP teaches subproblem thinking—Graphs are just those subproblems connected. Master the logic, not the library. 💡 #DSA #DynamicProgramming #Graphs #TechTwitter

Day 76 of my DSA journey 💻 Learned dynamic programming problems: 🔹 Longest Common Substring 🔹 Longest Increasing Subsequence 🔹 Wildcard Matching 🔹 String Conversion 🔹 Edit Distance Each problem deepened my DP understanding! #100DaysOfCode #DSA #DynamicProgramming

🧠 Day 1 of learning Dynamic Programming (DP) in C++ begins today! I already know recursion now it’s time to learn how to remember solutions instead of repeating them. Let’s turn brute force into brilliance 🚀 #100DaysOfCode #DynamicProgramming #Cplusplus

⚡ Day 29 of #100DaysOfCode Solved: Maximum Product Subarray 💥 Tackled the challenge of handling negative numbers by tracking both max and min products dynamically. 💡 Lesson: Dynamic thinking helps handle edge cases smoothly. #LeetCode #DynamicProgramming #Arrays #100DaysOfCode

Best resource to learn DP ? #dynamicprogramming #AI

Day 88–92 | Sigma 7.0 | #100DaysOfCode Learned: 🔹 Rod Cutting 🔹 LCS (All 3 Approaches) 🔹 Longest Common Substring 🔹 LIS 🔹 Edit Distance Thanks @ShradhaKhapra_ Ma’am & @ApnacollegeX 🙏 #DSA #DynamicProgramming #ApnaCollege #ShradhaKhapra #CodingJourney

Day 97 | Sigma 7.0 | #100DaysOfCode Covered more DP gems 💎 🔹 MCM (Memoization & Tabulation) 🔹 Minimum Partitioning 🔹 Minimum Array Jumps Bit by bit, mastering Dynamic Programming 💪 Thanks @ShradhaKhapra_ Ma’am & @ApnacollegeX 🙏 #DSA #DynamicProgramming #ShradhaKhapra #DP

🧩 LeetCode 300: Longest Increasing Subsequence 🔑 Idea → DP + Binary Search ⚡ Approach → Recursion + Memoization → Tabulation → O(n log n) 💡 Learning → Optimizing step by step shows the true power of DP 🚀 #LeetCode #DynamicProgramming #DSA #100DaysOfCode #ProblemSolving

Print Longest Increasing Subsequence 1️⃣ Build dp - length of LIS at each index 2️⃣ Use hash - track predecessors to backtrack 3️⃣ Find LIS end, trace back, reverse - actual subsequence #DynamicProgramming #100DaysOfCode #LearnInPublic #Coding #DSA

Pulling an all-nighter 🌙 Started with DP but decided to brush up recursion first 🔁 #Coding #Recursion #DynamicProgramming #AllNighter #DevLife

🧩 LeetCode 1547: Minimum Cost to Cut a Stick 🔑 Idea → Interval #DP + Divide & Conquer ⚡ Approach → Recursive splits + memoization 💡 Learning → DP on partitions = optimal cuts + state reuse 🚀 #LeetCode #DynamicProgramming #Algorithms #DSA #ProblemSolving #100DaysOfCode

#DynamicProgramming. started today learn 3 approaches to tackle after recursion m1->top to down approach m2->tabulation OR down to UP approach m3->Space Optimisation approach(m2 ka pattern dekho kuchh milega wahi m3 hai)

🔺Day 56/100 DSA Solved Triangle Minimum Path Sum using bottom-up DP. Pick the smaller of the two paths below at each step → final answer at the top! 💡 #100DaysOfCode #DSA #DynamicProgramming

🚀Day 28 of DSA Journey: Solved DP Question #DSA #CodingJourney #DynamicProgramming #100DaysOfCode Maximum sum of non-adjacent elements

💻 DSA Day 55 Today I learned Best Time to Buy & Sell Stock (DP on Stocks). Used Dynamic Programming (space optimized). Time Complexity: O(n) Space Complexity: O(1) 👉 Key Idea: Keep track of the minimum price & maximize profit. #100DaysOfCode #DSA #DynamicProgramming

🚀 Day 142: Edit Distance Classic DP on Strings problem 💡 ✔️ Allowed operations: Insert, Delete, Replace #DynamicProgramming #Strings #EditDistance #gfg160 #100DaysOfCode #geekstreak2025 @geeksforgeeks

Day 63 of #100DaysOfCode 🚀 Solved Minimum Score Triangulation of Polygon (LeetCode 1039). #LeetCode #DynamicProgramming #ProblemSolving

Leetcode 300. Longest Increasing Subsequence 1️⃣ Naive recursion: take/skip - exponential 2️⃣ Add "last chosen index" - valid subsequences 3️⃣ Memoize (ind,last+1) Brute -> State -> DP #LearnInPublic #100DaysOfCode #DynamicProgramming #LeetCode

Leetcode 1092. Shortest Common Supersequence Build LCS table to find overlaps 1️⃣ If chars match - extend sequence 2️⃣ If not - take max from left/top 3️⃣ Backtrack through DP table to build final supersequence #DynamicProgramming #LearnInPublic #LeetCode

🚀 Day 77 of my #100DaysOfDSA Today I practiced: ✅ Balanced Parentheses combinations 🧩 ✅ Minimum Partitioning 🔢 ✅ Minimum Partitioning (Zero Difference) ⚖️ ✅ Tribonacci Series 🔺 Slowly mastering DP one problem at a time 💪 #DynamicProgramming #CodingJourney #DSA

🚀Day 27 of DSA Journey: Solved DP Question #DSA #CodingJourney #DynamicProgramming #100DaysOfCode Frog Jump

📘 Wrapped up with the 7th Dynamic Programming pattern — DP on LIS (Longest Increasing Subsequence)! 🎯 Up Next: ➡️ DP on MCM (Matrix Chain Multiplication)! ➡️ DP on Squares! #StriversA2ZDSASheet #100DaysOfCode #DynamicProgramming #DSA #CodingJourney

🧵 Day 264 of #geekstreak2025 ✅ GFG POTD: Unique Paths in a Grid 🧠 Used classic DP approach — bottom-up tabulation to count ways from (0,0) to (n-1,m-1). Each cell = sum of top & left paths Efficient and elegant! 🔁 #dsa #dynamicprogramming #grid #potd #gfg264

#Day83 Solved Coin Change II 💰using Tabulation DP 🔹Transition:  if coins[i-1] <= j: dp[i][j] = dp[i][j - coins[i-1]] + dp[i-1][j]  else → exclude: dp[i][j] = dp[i-1][j] Pattern: Count of subsets with repetition allowed #DynamicProgramming #LeetCode #100DaysOfCode #DSA #tech

🚀 Day 383 of Code 🚀 Solved: ✅ 2787. Ways to Express an Integer as Sum of Powers #Day383 #LeetCode #DynamicProgramming #Math #Combinatorics #DSA #ProblemSolving #CodingChallenge #Algorithm #DataStructures #100DaysOfCode