C++ easy solution || Clean code
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)$$ --> O(n)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ --> O(1)\n\n# Code\n```\nclass Solution {\npublic:\n    int furthestDistanceFromOrigin(string moves) {\n        \n        int lefts = 0;\n        int rights = 0;\n        int blanks = 0;\n        \n        for(int i=0; i<moves.size(); i++){\n            if(moves[i]==\'L\') lefts++;\n            \n            else if(moves[i]==\'R\') rights++;\n            \n            else blanks++;\n        }\n        \n        return blanks+ abs(rights-lefts);\n    }\n};\n```
['Array', 'Math', 'Counting', 'C++']