Skip to content
LC-2833 Easy LeetCode

2833. Furthest Point From Origin

Read the full problem statement on LeetCode.
Difficulty: easy Acceptance: 64% Topics: String, Counting
View full problem on LeetCode
Reference solution (spoiler · python)
# Time:  O(n)
# Space: O(1)

# math
class Solution(object):
    def furthestDistanceFromOrigin(self, moves):
        """
        :type moves: str
        :rtype: int
        """
        curr = cnt = 0
        for x in moves:
            if x == 'L':
                curr -= 1
            elif x == 'R':
                curr += 1
            else:
                cnt += 1
        return abs(curr)+cnt

Solution from kamyu104/LeetCode-Solutions · MIT