LeetCode 2435 🔥 | Paths in Matrix Divisible by K | DP (Rec + Memo) Explained

Today’s LeetCode Daily Challenge is 2435 – Paths in Matrix Whose Sum Is Divisible by K.

Code:
https://github.com/studyPlacement/Cod...

Graph for Placemenets:
   • Graph  

Linked List:
   • Linked List  

Arrays:
   • Arrays  

Leetcode Contests:
   • Leetcode Contests  

Neetcode 150 Playlist:
   • Neetcode 150 by Study Placement  

SDE Sheet for Interview:
   • SDE Sheet For Interviews  

DP Playlist:
   • DP Series | Placement Focused | Study Plac...  

Sliding window Playlist:
   • Sliding Window  

Binary Search Playlist:
   • Binary Search  

In this video, we solve the problem using Dynamic Programming with Recursion + Memoization.

⭐ Approach Used (Top-Down DP)

We define a state:

dp[r][c][rem] = number of paths from (r, c) to bottom-right
where current path-sum % K == rem

At each cell we have two choices:

Move Right

Move Down


We update the remainder:

newRem = (rem + grid[r][c]) % K

Base Case:

At bottom-right → valid path only if (sum % K == 0).


Memoizing all states gives a clean O(m * n * K) solution.

⭐ What you will learn:

Full dp state design

Recursion + memoization for grid problems

How modulo affects transitions

Optimal solution for today’s DCC

Clean code + dry run


Perfect for improving your grid DP + modulo logic.

🚀 Topics Covered:

Dynamic Programming

Recursion + Memoization

Grid paths

Modulo arithmetic

LeetCode Daily Challenge


#LeetCode2435 #DCC #DailyChallenge #GridDP #ModuloDP #Recursion #Memoization #DSA #LeetCodeSolution #StudyPlacement #CodingInterview