Python3 approach || using replace 🎆👉🎇
time: ???\nspace: ???\nauxiliary: ??????\n\nclass Solution:\n    def furthestDistanceFromOrigin(self, moves: str) -> int:\n        if "L" not in moves and "R" n
time: ???\nspace: ???\nauxiliary: ??????\n```\nclass Solution:\n    def furthestDistanceFromOrigin(self, moves: str) -> int:\n        if "L" not in moves and "R" not in moves: return len(moves)\n        maxMove = max([moves.count("L"), moves.count("R")])\n        most = ""\n        if moves.count("L") == maxMove: most = "L"\n        elif moves.count("R") == maxMove: most = "R" \n        moves = moves.replace("_", most)\n        print(moves)\n        pos = 0\n        for m in moves:\n            if m == "L": pos -= 1\n            else: pos += 1\n        return abs(pos)\n```
['Python3']