Available question text
Determine whether a sequence of moves ('U','D','L','R') returns a robot to the origin by checking that the net horizontal and vertical displacements cancel out (i.e., counts of 'L' vs 'R' and 'U' vs 'D' are equal).
Related questions
Continue with questions that share topics or the same question type.
- Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane, return the k closest points to the origin (0, 0). Discuss expected vs. worst-case time complexity.
Coding
- change directory via i.e. bash -> write a function given current directory and a new location return the new path
Coding
- Count Robot Groups
Coding
- Delete Nodes And Return Forest
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 657. Robot Return to Origin
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source