← All problemsSign in

Asya & Number of Paths

Asya is a very intelligent girl and today she has come with a very interesting challenge for you. She has given you a matrix of size N x M. You have to travel through the matrix from (1, 1) to (N, M) and the only moves allowed from a cell (x, y) are (x + 1, y) or (x, y + 1). Sounds easy right !! Well, to make it lil more challenging, Asya has kept D disks on some cells of the matrix. She

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start