Javascript Simplest | O(n) & O(1) | 92%
IntuitionThe problem requires finding the furthest distance from the origin after executing a series of moves ('L', 'R', and '_'). Since 'L' moves left and 'R'
## Intuition  
The problem requires finding the furthest distance from the origin after executing a series of moves (`'L'`, `'R'`, and `'_'`). Since `'L'` moves left and `'R'` moves right, the net displacement is determined by their difference. The `'_'` can be treated as a move in the most advantageous direction to maximize the distance.  

## Approach  
1. Count the occurrences of `'L'`, `'R'`, and `'_'` in the string.  
2. Compute the absolute difference between `'L'` and `'R'` to get the net displacement.  
3. Add the count of `'_'` to the displacement, as they can be used to move in the direction that increases the distance.  

## Complexity  
- **Time Complexity:** \( O(n) \) – We iterate through the string once.  
- **Space Complexity:** \( O(1) \) – We use only a few integer variables.  

## Code  
```javascript
/**
 * @param {string} moves
 * @return {number}
 */
var furthestDistanceFromOrigin = function(moves) {
    let lLen = 0, rLen = 0, uLen = 0;
    for (const move of moves) {
        if (move === 'R') rLen++;
        else if (move === 'L') lLen++;
        else uLen++;
    }
    return Math.abs(lLen - rLen) + uLen;
};
```
['Two Pointers', 'String', 'Counting', 'JavaScript']