Count paths in 2D matrix with at most K turns
Filed under MindTickle
The question
Given a 2D matrix where movement is allowed only right (i, j+1) and down (i+1, j), count the number of paths from (0, 0) to (n, m) using at most K turns, where a turn is a change in direction.
No write-up yet. Related questions below have one.
Related MindTickle questions
Collected from public candidate posts and coding forums. Updated Nov 2026.