Skip to content

Practice Self Crossing

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#335
LeetCode Problem

Self Crossing

ArrayMathGeometry

Problem Statement

You are given an array of integers distance. You start at the point (0, 0) on an X-Y plane, and you move distance[0] meters to the north, then distance[1] meters to the west, distance[2] meters to the south, distance[3] meters to the east, and so on. In other words, after each move, your direction changes counter-clockwise. Return true if your path crosses itself or false if it does not.

Source: Self Crossing on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
distance = [2,1,1,2]
Output
true

# Example 2

Input
distance = [1,2,3,4]
Output
false

# Example 3

Input
distance = [1,1,1,2,1]
Output
true

Constraints

1 <= distance.length <= 10^5
1 <= distance[i] <= 10^5

Related LeetCode Problems

Practice more problems similar to Self Crossing.

1 Two Sum Easy2 Add Two Numbers Medium4 Median of Two Sorted Arrays Hard7 Reverse Integer Medium9 Palindrome Number Easy
← Previous Increasing Triplet SubsequenceNext → Palindrome Pairs

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free