Simple || Easy to understand || C++
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:O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int furthestDistanceFromOrigin(string s) {\n        // count the left and right\n        int count = 0;\n        // count underscore\n        int u = 0;\n        for(int i=0;i<s.length();i++){\n            if(s[i] ==\'L\') count--; // count left\n            else if(s[i] == \'R\') count++; //count right\n            else u++; // count underscore\n        }\n        if(count<0) count *= -1; //if count is negative number \n        return u+count;\n    }\n};\n\n```
['C++']