Substring with Concatenation of All Words

check each possible position i to see if the substring start at position i is a Concatenation of All Words.

class Solution {
public:
    vector<int> findSubstring(string S, vector<string> &dict) {
        const int wordLength = dict.front().size();
        const int totalLength = wordLength*dict.size();
        
        vector<int> result;
        
        unordered_map<string, int> map;
        for(auto word: dict)
            map[word]++;
        
        for(int i=0; i+totalLength <= S.size(); i++)
        {
            unordered_map<string, int> mapcopy(map);
            int j = 0;
            for(; j<dict.size(); j++)
            {
                int start = wordLength*j + i;
                string str = S.substr(start, wordLength);
                if(mapcopy[str] > 0)
                {
                    mapcopy[str]--;
                }
                else
                    break;
            }
            if(j == dict.size()) result.push_back(i);
        }
        return result;
    }
};