Day 38 🔥 #geekstreak60 POTD Solved @geeksforgeeks @NPCI_NPCI Partitions with Given Difference Subset Sum + DP 🧠 Target = (total + diff) / 2 🚀 #DSA #DynamicProgramming #Python #GeeksforGeeks #ProblemOfTheDayIRM

Day 67 | DSA Problem: House Robber • Rob houses in a row without robbing adjacent ones • DP: max = max(curr + rob1, rob2) • rob1 → prev prev max, rob2 → prev max • Return max money robbed • Time: O(n), Space: O(1) #Java #Leetcode #DynamicProgramming

🚀 Day 38/60 of #geekstreak60 Solved Chocolates Pickup 🍫 2 robots + 3D DP 🔥 Think multi-pointer DP ✔️ #DSA #DynamicProgramming #npci @NPCI_NPCI @geeksforgeeksV6M

Day 37 of #geekstreak60 Solved GFG POTD: Chocolates Pickup Used 3D DP to track both robots’ positions and maximize total chocolates collected. Key idea: Explore all 9 moves and handle overlap to avoid double counting. #DSA #DynamicProgramming @geeksforgeeks @NPCI_NPCI

Day 13— GFG POTD 🍫 (HARD) Chocolates Pickup 🤖🤖 🧠 3D DP — Multi-robot grid traversal ✔ State: (row, c1, c2) ✔ 9 transitions per step ✔ Avoid double counting Hard problems = real growth 💀🔥 @geeksforgeeks #GFGPOTD #DSA #DynamicProgramming #CodingJourneyNZTqp9

Day 37/60 🚀 Solved Chocolates Pickup 🍫 (Hard DP)💡 Learned 3D DP: dp[row][c1][c2] Two robots → 9 moves each step Handle same cell carefullyConsistency > perfection 💪#geekstreak60 #DSA #DynamicProgramming @geeksforgeeks @NPCI_NPCIKeXr

Day 37/60 🚀 Solved Chocolates Pickup 🍫 (Hard DP)💡 Learned 3D DP: dp[row][c1][c2] Two robots → 9 moves each step Handle same cell carefullyConsistency > perfection 💪#geekstreak60 #DSA #DynamicProgramming @geeksforgeeks @NPCI_NPCIUM3Z

Day 66 | DSA • Problem: Climb n stairs (1 or 2 steps) • DP: dp[i] = dp[i-1] + dp[i-2] • Base: dp[0]=1, dp[1]=1 • Count ways to reach top • Time: O(n), Space: O(n) #Java #Leetcode #DynamicProgramming

2 robots 🤖 1 grid 🍫 9 choices every step… Sounds easy? It’s a Hard DP problem 😮‍💨 Learned how to think in 3D DP states (i, j1, j2) today 🧠 This is not just coding… this is strategy. #KeepCoding #DSA #DynamicProgramming #100DaysOfCodeDJMSp

Day 32/60 – #geekstreak60 Solved Chocolates Pickup using 3D DP (two robots in grid) Time – O(N × M²) | Space – O(M²) #DynamicProgramming #DP #Grid @syntaxsquad30 @gfg_sstc @NPCI_NPCI

🚀 Day 41/60 – GFG × NPCI Challenge Solved: Chocolates Pickup Approach: 🍫 3D Dynamic Programming Two robots collecting chocolates simultaneously using DP state transitions. 💪 #60DaysChallenge #DSA #DynamicProgramming #GeeksforGeeks #NPCI @geeksforgeeks @NPCI_NPCIToG

At what exact point does the recursion stop exploding?#dynamicprogramming #algorithms #fibonacci

Day 33/60 of #geekstreak60 ✅ Solved Chocolates Pickup Idea: Approach: 3D DP → dp[i][j1][j2] Try all 9 moves Handle same cell case Time: O(n × m × m) Space: O(n × m × m) Thanks @GeeksforGeeks @NPCI_NPCI #DSA #DynamicProgramming #Algorithms #Consistency

🚀 Day 39 of #geekstreak60 Solved: Chocolates Pickup 🍫 ✔️ 1112/1112 test cases ✔️ 100% 💯 ✔️ 3D DP (2 Robots) @geeksforgeeks @NPCI_NPCI #DSA #DynamicProgramming #Coding #geeksforgeeksEbg

his DP solution uses a 3D state dp[row][col1][col2] to track both robots’ positions and maximize chocolates collected. 📌 Tags: #NPCI #GeeksforGeeks #DynamicProgramming #CodingChallenge #ProblemOfTheDayv

Day 39/60 – GFG POTD 🚀 Solved Chocolates Pickup (Hard) 🍫 👉 Applied 3D DP (row, col1, col2) 👉 Explored 9 moves at each step 👉 Optimized to 2D DP Great problem for multi-agent DP & grid traversal 💡 @geeksforgeeks @NPCI_NPCI #GFGPOTD #DSA #DynamicProgramming #CodingaMmaPQ

Day 37/60 🚀 Solved Chocolates Pickup 🍫 (Hard DP)💡 Learned 3D DP: dp[row][c1][c2] Two robots → 9 moves each step Handle same cell carefullyConsistency > perfection 💪#geekstreak60 #DSA #DynamicProgramming @geeksforgeeks @NPCI_NPCIU64K

Day 85. Top Engineer Arc. 🚀 > POTD ✅ (That was a easier but take a lot of time) > Learned about a new DP pattern. Will Speed Up From Tommorow. ⚡ #LeetCode #DynamicProgramming #100DaysOfCode

Most people fail Cherry Pickup II because they try to move Alice and Bob one after the other. ❌ The secret? Move them simultaneously. Since they always stay on the same row, you only need 3 variables (i, j1, j2) to track everything. #365DaysOfCode #DynamicProgramming #Day146

Day 83 & 84. Top Engineer Arc. 🚀 > POTD ✅ > Solved 3 DP patterns and 5 DP problems. > CodeChef contest: 4/7. > College assignments, submissions, and presentations completed. ✅ #LeetCode #DynamicProgramming #CodeChef #100DaysOfCode