Leetcode 2435. Paths in Matrix Whose Sum Is Divisible by K

Count the number of down/right paths from the top-left to bottom-right of a grid whose path-sum is divisible by k, returning the result modulo 1e9+7. This requires dynamic programming that tracks, at each cell, counts of paths for each sum remainder mod k (k ≤ 50), yielding an O(m·n·k) solution.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2435. Paths in Matrix Whose Sum Is Divisible by K

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact