easiest solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int furthestDistanceFromOrigin(string moves) {\n        int leftCount = 0;\n        int rightCount = 0;\n        int gap = 0;\n         \n        for(int i=0;i<moves.length();i++){\n            if(moves[i]==\'L\') leftCount++;\n            else if(moves[i]==\'R\') rightCount++;\n            else gap++;\n        }\n        return abs(leftCount-rightCount)+gap;\n    }\n};\n```
['C++']