100% beats soln
IntuitionApproachL-> move left, decrease count.
r-> move right,increase count.
_-> increase count,as we have to go furtheset dist.Complexity
Time complexity:

S
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->
L-> move left, decrease count.
r-> move right,increase count.
_-> increase count,as we have to go furtheset dist.
# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int furthestDistanceFromOrigin(string moves) {
        int dist=0;
        int underdist=0;

        for(int i=0;i<moves.size();i++){
            if(moves[i]=='_'){
                underdist++;
            }else if(moves[i]=='L'){
                dist--;
            }else{
                dist++;
            }
        }
        return abs(dist)+underdist;
        
    }
};
```
['C++']