Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C++

Self Crossing

Explore how to analyze an array of movements on a coordinate plane to identify self crossing paths. Understand the sequence of moves and apply geometric reasoning to return true if the path intersects itself. This lesson equips you to solve coordinate geometry problems related to movement tracking.

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 (0,0)(0, 0), and move according to the array. Specifically, you move distance[0] meters north, distance[1] meters west, distance[2] meters south, distance[3] meters east, and continue this pattern in a counterclockwise ...