Search
⌘K

Leetcode 1496. Path Crossing

Given a sequence of unit moves (N/S/E/W) on a 2D grid, determine whether the walk ever visits the same coordinate twice. The core task is detecting any duplicate positions while simulating the moves (expected O(n) time and space).


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.