Write a program to find the robot return to origin

The problem:

There is a robot starting at the 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.

You have given a string of moves that represent the move sequence of the robot where moves[i] represent 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.

Note: The way that the robot is “facing” is irrelevant. ‘R’ will always make the robot move to the right once, ‘L’ will always make it move left, etc. Also, assume that the magnitude of the robot’s movement is the same for each move.

Example #1

Input: moves = "UD"
Output: true
Explanation: The robot moves up once, and then down once. All moves have the same magnitude, so it ended up at the origin where it started. Therefore, we return true.

Example #2

Input: moves = "LL"
Output: false
Explanation: The robot moves left twice. It ends up two "moves" to the left of the origin. We return false because it is not at the origin at the end of its moves.

The solution

    const judgeCircle = function(moves) {
        function getFrequency(string) {
            const freq = {};
            for (let i = 0; i
Another solution
    const judgeCircle = function(moves) {
        let x = 0, y = 0;
        for (let move of moves) {
            switch(move) {
                case 'U': y++ ;break;
                case 'D': y-- ;break;
                case 'L': x-- ;break;
                case 'R': x++ ;break;
            }
        }
        return x === 0 && y === 0
    };

    console.log(judgeCircle('LLRRL')); // false