Easy Solution || 0ms || Beats 100% users
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# 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 l=0,r=0,u=0;
        for(char i:moves){
            if(i=='L'){
                l++;
            }else if(i=='R')
                r++;
            else
                u++;
        }

        if(l>r){
            l+=u;
        }else
            r+=u;
        
        return abs(l-r);
    }
};
```
['C++']