Rat in the maze
CodeChefOpen on judge ↗
We all have might have played the game called Maze in our childhood.A maze is a path or collection of paths, typically from an entrance to a goal. Here,a rat placed at $(0, 0)$ in a square matrix $m[][]$ of order n and has to reach the destination at $(n-1, n-1)$. Your task is to display a sorted array of strings denoting all the possible directions which the rat can take to reach the destination
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.
Sign in to chat with the tutor and save your progress.
Sign in to start