Why doesn’t the KMP algorithm cater for a pattern in which all of the characters are the same
I am trying to understand why the KMP algorithm does not cater for a special case in which all of the characters of the pattern we are trying to find are known to be the same.