Furthest Point From Origin — LeetCode 2833 Python Solution

The problem

You are given a string moves of length n consisting only of characters 'L', 'R', and '_'. The string represents your movement on a number line starting from the origin 0.

Example

Input

moves = "L_RL__R"

Output

3

Explanation

The furthest point we can reach from the origin 0 is point -3 through the following sequence of moves "LLRLLLR".

Python solution

class Solution:
    def furthestDistanceFromOrigin(self, moves: str) -> int:
        return abs(moves.count("L") - moves.count("R")) + moves.count("_")

Complexity

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 2833. Furthest Point From Origin is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Counting.

The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.

Related problems