874. Walking Robot Simulation

LeetCodeArrayHash TableSimulationOpen on judge ↗

A robot on an infinite XY-plane starts at point (0, 0) facing north. The robot receives an array of integers commands, which represents a sequence of moves that it needs to execute. There are only three possible types of instructions the robot can receive: - -2: Turn left 90 degrees. - -1: Turn right 90 degrees. - 1 <= k <= 9: Move forward k units, one unit at a time. Some of the grid squares

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