16.md

Check if a string is repetition of its substring of k-length

int kSubstrConcat (int n, string s, int k)
	{
	    // Your Code Here
	    if(n%k!=0)
	        return 0;
	    unordered_map<string,int> m;
	    
	    int i=0;
	    while((i+k-1)<n)
	    {
	        string str=s.substr(i,k);
	        m[str]++;
	        i+=k;
	    }
	 
	    if(m.size()<=2 )
	        return 1;
	    else
	        return 0;
	}