Python and Rust Solutions: 0 ms
Python Solutions\npython []\nclass Solution:\n    def furthestDistanceFromOrigin(self, moves: str) -> int:\n        l_count, r_count = moves.count(\'L\'), moves
# Python Solutions\n```python []\nclass Solution:\n    def furthestDistanceFromOrigin(self, moves: str) -> int:\n        l_count, r_count = moves.count(\'L\'), moves.count(\'R\')\n        return abs(l_count - r_count) + (len(moves) - (l_count + r_count))\n```\n```python []\nclass Solution:\n    def furthestDistanceFromOrigin(self, moves: str) -> int:\n        l_count, r_count, _count = (0, 0, 0)\n        for move in moves:\n            if move == \'L\':\n                l_count += 1\n            elif move == \'R\':\n                r_count += 1\n            else:\n                _count += 1\n        return abs(l_count - r_count) + _count\n```\n\n# Rust Solutions\n```rust []\nimpl Solution {\n    pub fn furthest_distance_from_origin(moves: String) -> i32 {\n        let [l_count, r_count, _count] = moves.chars().fold([0, 0, 0], |mut acc, m| {\n            match m {\n                \'L\' => acc[0] += 1,\n                \'R\' => acc[1] += 1,\n                \'_\' => acc[2] += 1,\n                _ => {}\n            }\n            acc\n        });\n        (l_count as i32 - r_count).abs() + _count\n    }\n}\n```\n```rust []\nimpl Solution {\n    pub fn furthest_distance_from_origin(moves: String) -> i32 {\n        let (mut l_count, mut r_count, mut _count) = (0, 0, 0);\n        for m in moves.chars() {\n            match m {\n                \'L\' => l_count += 1,\n                \'R\' => r_count += 1,\n                \'_\' => _count += 1,\n                _ => {}\n            }\n        }\n        (l_count as i32 - r_count).abs() + _count\n    }\n}\n```
['Python3', 'Rust']