int left = 0 , right = 0 , len = 0 ; int n = str.size(); while(right<n){ if(mpp[str[right]]!=-1) left = max(left , mpp[str[right]]+1); mpp[str[right]] = right; len = max(len , right-left+1); right++; } return len;
int left = 0 , right = 0 , len = 0 ; int n = str.size(); while(right<n){ if(mpp[str[right]]!=-1) left = max(left , mpp[str[right]]+1); mpp[str[right]] = right; len = max(len , right-left+1); right++; } return len;