while (i < j)
{
while (j < s.size() - 1 && s[j + 1] == ch){
j++;
}
int currentLength = j - i + 1;
ans = max(ans, currentLength);
i++;
if (j < s.size() - 1 && s[i - 1] != ch)
j++;
}
return ans;
}
can you please explain what’s the second loop doing .
and you please refer a video for it