100 % beats in Both space and time || simple 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```\nclass Solution {\npublic:\n    int furthestDistanceFromOrigin(string moves) {\n        int sCount=0;\n        int rCount=0;\n        int lCount=0;\n        for(int i=0;i<moves.size();i++){\n            if(moves[i]==\'_\')sCount++;\n            else if(moves[i]==\'L\')lCount++;\n            else rCount++;\n        }\n        return lCount>=rCount ? lCount-rCount+sCount : rCount-lCount+sCount;\n    }\n};\n```
['C++']