Python 3   ||   2 lines,  w/ explanation   ||   T/S: 92% / 97%
Here\'s the intuition:\n\nThe presentation of the moves as a list is a red herring. The answer is determined solely by how many left moves (L), right moves (R),
Here\'s the intuition:\n\nThe presentation of the moves as a list is a *red herring*. The answer is determined solely by how many left moves (`L`), right moves (`R`), and optional moves (`_`) are performed; the ordering of the moves is not a factor.\n\nWe first consider the position after the left and right moves are performed. Which ever side we are on, we use the optional moves to increase the distance from the origin.\n```\nclass Solution:\n    def furthestDistanceFromOrigin(self, moves: str) -> int:\n\n        ctr = Counter(moves)\n\n        return abs(ctr[\'L\'] - ctr[\'R\']) + ctr[\'_\']\n```\n[https://leetcode.com/problems/furthest-point-from-origin/submissions/1032866730/](http://)\n\nI could be wrong, but I think that time complexity is *O*(*N*) and space complexity is *O*(1), in which *N* ~ `len(moves)`. (In general, `Counter` is *O*(*N*) space complexity, but note we have at most three keys.)
['Python3']