Robot Path 🤖

Published by Mubashir Hassan in
algorithmslanguage_fundamentalslogicvalidation

Mubashir created a simple robot that is navigated by a series of North, East, South, and West [n, e, s, w] commands. Each command moves the robot one step in the given direction. The robot is designed for only two destinations:

  • Destination No. 1: e, n, e, e, n
  • Destination No. 2: w, n, w, n, w, w, n

Create a function that takes an array of commands and returns true if the robot reaches any of the destinations, false otherwise.

Examples

robot_path(["s", "e", "e", "n", "n", "e", "n"]) âžž true
# Robot will end up at destination no. 1

robot_path(["n", "e", "s", "w", "n", "e", "s", "w", "w", "s", "n", "e"]) âžž false
# Robot will be lost somewhere

robot_path(["n", "s", "n", "n", "e", "n", "w", "w", "s", "w", "w", "w", "n"]) âžž true

Notes

N/A

Watch a quick demo on how Edabit works.