class Solution {
public:
    int furthestDistanceFromOrigin(string moves) 
    {
       unordered_map<char, int>m;
        int n=moves.size();
        int Lvalue=0;
        int Rvalue=0;
        int DashValue=0;
        for(int i=0;i<n;i++)
        {
            m[moves[i]]++;
        }
        
        for(auto i: m)
        {
            if(i.first=='R')
            {
                Rvalue=i.second;
            }
            else if(i.first=='L')
            {
                Lvalue=i.second;
            }
            else
            {
                DashValue=i.second;
            }
        }
        
        int result=0;
        
        if(Rvalue==0 && Lvalue==0)
        {
            return DashValue;
        }
        
        if(Rvalue>Lvalue)
        {
            result= (Rvalue+ DashValue) - Lvalue;
        }
        else
        {
            result=(Lvalue+ DashValue)-Rvalue;
        }
        return result;
    }
};