"""

    LeetCode 657. 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). If the robot returns to the origin
    after it finishes all of its moves, return true. Otherwise, return false.

    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: "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: "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.

"""


def did_robot_return_to_origin(moves):
    """
        Function to check if robot returns to origin after certain moves
        :param moves: String containing moves of the robot e.g. "LRUDLLR"
        :return:
            true: if robot returns to origin
            false: if robot does not return to origin
    """
    x_axis = 0
    y_axis = 0

    axis_movement_value = {
        "L": -1,
        "R": 1,
        "U": 1,
        "D": -1,
    }

    for move_direction in moves:
        if move_direction in ["L", "R"]:
            x_axis += axis_movement_value[move_direction]
        else:
            y_axis += axis_movement_value[move_direction]
    if x_axis == 0 and y_axis == 0:
        return True
    return False
