A robot starts at the origin on a 2D plane and receives a sequence of moves in moves.

Each character in moves represents one move:
'U' moves the robot up, 'D' moves it down, 'L' moves it left, and 'R' moves it right.

Return true if the robot returns to the origin after completing all moves. Otherwise, return false.

Note: The robot starts at the origin.

Constraints:

• $1 <=$ moves.length $<= 2 * 10^4$

• moves only contains the characters 'U', 'D', 'L', and 'R'

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.