leetle

Daily challenge for 2025-12-06

340. Robot Return to Origin

There is a robot starting at position (0, 0), the origin, on a 2D plane. Given a sequence of its moves, judge if this robot ends up at (0, 0) after it completes its moves.

The move sequence is represented by a string, and the character moves[i] represents its ith move. Valid moves are 'R' (right), 'L' (left), 'U' (up), and 'D' (down).

Return true if the robot returns to the origin after it finishes all of its moves, or false otherwise.

Example:
Input: moves = "UD"
Output: true

Example 2:
Input: moves = "LL"
Output: false

Run this challenge interactively in Python or JavaScript when the app loads.