C++ solution || Easy explanation
\nclass Solution {\npublic:\n    int furthestDistanceFromOrigin(string moves) {\n        \n        int cl=0,cr=0,gap=0;\n        for(int i=0;i<moves.length();i+
```\nclass Solution {\npublic:\n    int furthestDistanceFromOrigin(string moves) {\n        \n        int cl=0,cr=0,gap=0;\n        for(int i=0;i<moves.length();i++)\n        {\n            if(moves[i]==\'R\')\n                cr++;\n            else if(moves[i]==\'L\')\n                cl++;\n            else\n                gap++;\n        }\n        if(cl>=cr)\n            return cl+gap-cr;\n        return cr-cl+gap;\n    }\n};\n```\n\nIn this case we find the count of number of left, right and underscore. Then we change underscore according to left or right accoding to their highest count.
['C']