#dynamicprogramming zoekresultaten
I hit that 80% wall with Lovable, you know, when the idea works, but everything breaks the moment you add “just one more feature.” Debugging felt like blindfolded coding in a black box. Here’s how I turned that chaos into control, and shipped production-grade apps without…
Coding was never really about writing code. It was about breaking a problem into steps, imagining the edge cases, and knowing where trade-offs live. AI just took away the boring part. What’s left is the real work: thinking clearly.
7 Reddit communities to learn AI better than most paid courses:
@DynamiqAGI redefine cómo las empresas construyen aplicaciones con IA. Crea flujos low-code, gestiona datos con control total y despliega en cualquier entorno (on-premise, híbrido o nube). Entrena tus modelos sin perder propiedad de los datos. app.getdynamiq.ai/?fpr=menteprom…
🧩 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
Dynamic programming was invented to confuse the Secretary of Defense. Seriously. Wilson (the SecDef) “would get violent if people used the term research in his presence”. RAND mathematicians thus needed a cover story to hide their work:
#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 19 working with @cracked_black ✅ Solved 2 LeetCode questions ✅ Started with Dynamic Programming ✅ Made progress on my React project Step by step 🚀 #DSA #DynamicProgramming #React"
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
Learning in public #Day35 1. DSA - 4 questions on DP on subsets and subsequences, Leetcode 2035(hard q). less productive day :( #DynamicProgramming
📅20 August 2025 ✅ Solved: 🔹 Longest Increasing Subsequence using Memoization, Tabulation & Space Optimization 🔹 Print Longest Increasing Subsequence 💻 Revised Generics and Built a Custom ArrayList in Java #100DaysOfCode #DynamicProgramming #Java #DSA #CodingJourney #LeetCode
🧩 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
A dynamically animated abstract artwork with swirling and vibrant light patterns. Built with Three.js and GLSL shaders, the visual flow, rotation, and color phasing are interactively controlled by the mouse position. Live demo and code: codepen.io/VoXelo/full/em…
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 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 74 of my DSA journey! Dived into Dynamic Programming today — it’s super interesting! 💡 Learned about DP basics, Memoization, Tabulation, and solved: 🔹 Fibonacci 🔹 0/1 Knapsack 🔹 Unbounded Knapsack 🔹 Climbing Stairs 🔹 Target Sum #100DaysOfCode #DSA #DynamicProgramming
Day 28/100 ⚔️📊#100DaysOfCode 🧩 DSA: Solved Dungeon Game ⚔️ Revisited Triangle for deeper DP intuition 🔁 Every new DP problem teaches me how powerful optimization and pattern recognition can be. 🔥 #DynamicProgramming #100DaysChallenge #CodeNewbie #TechJourney
Dynamic Programming Patterns. Follow this Thread for more questions 1D leetcode.com/problems/climb… leetcode.com/problems/min-c… leetcode.com/problems/house… leetcode.com/problems/decod… leetcode.com/problems/integ… #dsa #dynamicprogramming #faang #leetcode
I learnt something new today! Did you know that tabulation doesn't always perform better than Memo for DP probs🤯😮 Checkout LC #516 #LeetCode #Coding #dynamicprogramming
🌟 Day 211/∞ 🚀 Solved Maximum Subarray ⚡ 💡 Applied Kadane’s Algorithm to find the maximum sum subarray. Time Complexity: O(n) | Space: O(1) — pure dynamic brilliance 💪 #LeetCode #DSA #DynamicProgramming #CodeEveryday #KeepCoding #100DaysOfCode
📘 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
Nonlinear and Dynamic Programming. Hadley ADDISON-WESLEY. 1964. 484p. 15.7×23.4 2000TL #NonlinearProgramming #DynamicProgramming #akademikzam instagram.com/p/DHNgmM9Kkwe/…
Just cracked the classic "Word Wrap" problem using Dynamic Programming! 💻 Think backward—calculating the minimum cost from the end of the array to the start. Amazing how dp[i] = cost(i, j) + dp[j+1] turns a complex problem into simple, repeatable steps. #dynamicprogramming
#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)
🧩 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
🧩 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
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
🔺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
Learning in public #Day35 1. DSA - 4 questions on DP on subsets and subsequences, Leetcode 2035(hard q). less productive day :( #DynamicProgramming
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 27 of DSA Journey: Solved DP Question #DSA #CodingJourney #DynamicProgramming #100DaysOfCode Frog Jump
🚀 Day 359 of Code 🚀 Solved: ✅ 3202. Find the Maximum Length of Valid Subsequence II #Day359 #DynamicProgramming #2DDP #LeetCode #CodingChallenge #DSA #Greedy #Subsequence #TechJourney #ProblemSolving
#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
![singh_jayraj_05's tweet image. #Day83
Solved Coin Change II 💰using Tabulation DP
🔹Transition:
if coins[i-1] &lt;= 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](https://pbs.twimg.com/media/GzmxUK_bEAATVw5.jpg)
🧵 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
🚀 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
🚀 Day 142: Edit Distance Classic DP on Strings problem 💡 ✔️ Allowed operations: Insert, Delete, Replace #DynamicProgramming #Strings #EditDistance #gfg160 #100DaysOfCode #geekstreak2025 @geeksforgeeks
📈 Day 133: LIS & LCS Double DP dose today! ✔️ Longest Increasing Subsequence ✔️ Longest Common Subsequence – classic 2D DP table approach #DynamicProgramming #LIS #LCS #gfg160 #100DaysOfCode #geekstreak2025 @geeksforgeeks
🧵 Day 134: Print All LCS & Longest String Chain ✔️ Print All LCS – backtrack from DP table to generate every sequence ✔️ Longest String Chain – sort by length, DP on word transformations #DynamicProgramming #Strings #gfg160 #100DaysOfCode #geekstreak2025 @geeksforgeeks
Something went wrong.
Something went wrong.
United States Trends
- 1. #WorldSeries 203K posts
- 2. Dodgers 250K posts
- 3. Freddie 93.7K posts
- 4. Klein 201K posts
- 5. Ohtani 134K posts
- 6. Kershaw 19.5K posts
- 7. Mookie 15.3K posts
- 8. Yamamoto 28.3K posts
- 9. #Worlds2025 8,473 posts
- 10. Lauer 5,174 posts
- 11. WHAT A GAME 42.8K posts
- 12. Joe Davis 2,263 posts
- 13. Victory 157K posts
- 14. Marlins 1,873 posts
- 15. Will Smith 14.1K posts
- 16. 18 INNINGS 14.1K posts
- 17. Dave Roberts 6,239 posts
- 18. Wikipedia 56.7K posts
- 19. Bottom of the 18th 2,466 posts
- 20. Schneider 12.5K posts