← All problemsSign in

Can Sam Escape

Sam is trapped in a 2-D Matrix of size $N$ by $M$.To escape he needs a key which is at position$(i,j)$ in the matrix.He is at Top-leftmost Position and the door is at Bottom -rightmost position.He can only travel right or down.Find the no of ways in which he can escape from the matrix. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each test case co

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