Easy Solution || 100% FASTER || UPVOTE
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 {\n    public int furthestDistanceFromOrigin(String moves) {\n        int left=0,right=0,common=0;\n        for(char c:moves.toCharArray()){\n            if(c==\'L\'){\n                left++;\n            }\n            else if(c==\'R\'){\n                right++;\n            }\n            else{\n                common++;\n            }\n        }\n        return Math.max(left+common-right,right+common-left);\n    }\n}\n```\n![7abc56.jpg](https://assets.leetcode.com/users/images/d2666891-02b2-46d6-8707-5dea059f5699_1693113472.0198886.jpeg)\n\n
['Java']