← All problemsSign in

21FA - 10 Panda Land

Panda Panda is traversing a $n \times m$ bamboo forest where he starts at the top left corner $(1, 1)$ and wants to walk to the bottom right corner $(n, m)$. He can only move down and right through the forest.   As the zookeeper, you get to decide how much bamboo is in each cell in the grid. However, each cell has a distinct number of bamboo in the range 0 through $n * m - 1$ inclusive.   Re

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