Self Crossing
Try to solve the Self Crossing problem.
We'll cover the following...
Statement
You are given an array of integers, distance
, where each element represents the length of a move you will make on an X-Y plane. You start at the origin, which is point distance[0]
meters north, distance[1]
meters west, distance[2]
meters south, distance[3]
meters east, and continue this pattern in a counterclockwise direction. Each step ...