Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Alphabet Board Path
Coding · Hash Table · String
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- change directory via i.e. bash -> write a function given current directory and a new location return the new path
Coding
- Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1496. Path Crossing
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source