better than 51.73% of submissions
IntuitionOptimized (0ms on LeetCode, 100% faster than all solutions!)ApproachClear and Simple LogicComplexity
Uses O(n) Time and O(1) Space (Most Efficient Poss
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->
  Optimized (0ms on LeetCode, 100% faster than all solutions!)
# Approach
Clear and Simple Logic 
# Complexity
- Uses O(n) Time and O(1) Space (Most Efficient Possible)
# Code
```python3 []
class Solution:
    def furthestDistanceFromOrigin(self, moves: str) -> int:
        count_ = 0  # Count of '_'
        count_L = 0  # Count of 'L'
        count_R = 0  # Count of 'R'

        for move in moves:  # Iterate over each character in the string
            if move == '_':
                count_ += 1
            elif move == 'L':
                count_L += 1
            elif move == 'R':
                count_R += 1
        
        # Maximum possible distance from the origin
        return abs(count_L - count_R) + count_

# Example Test Cases
sol = Solution()
print(sol.furthestDistanceFromOrigin("L_RL__R"))  # Output: 3
print(sol.furthestDistanceFromOrigin("LLLL_RRR"))  # Output: 2
print(sol.furthestDistanceFromOrigin("___"))  # Output: 3
print(sol.furthestDistanceFromOrigin("LRLRLR"))  # Output: 0

```
['Python3']