Paths in Matrix Whose Sum Is Divisible by K - Leetcode 2435 - Python
NeetCodeIO · 21:50
NeetCode solves LeetCode's "Paths in Matrix Whose Sum Is Divisible by K" with dynamic programming. The state is (row, column, running sum mod K), which gives O(R·C·K) time and space. He builds the memoized top-down so...