Teju in Maze

CodeChefOpen on judge ↗

Teju secretly goes to meet her girlfriend everyday. On the way he has to pass through the simply connected maze, so he uses Left hand rule to solve it everyday. Teju told you left hand path that contains L for left turn, R for right turn, S for straight, B for dead end. Since he eagerly waits to meet her girlfriend so he wants that the path should have least junctions. Help him to solve the maze.

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