Simple java 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 {\n    public int furthestDistanceFromOrigin(String moves) {\n        int c=0,c1=0,c2=0;\n        for(char m:moves.toCharArray())\n        {\n            if(m==\'L\')\n            {\n                c1++;\n            }\n            else if(m==\'R\')\n            {\n                c2++;\n            }\n            else\n            {\n                c++;\n            }\n        }\n        return Math.max(c1,c2)-Math.min(c1,c2)+c;\n    }\n}\n```
['Java']