Create an algorithm that determines if two strings,u and v, contain
1) the same substrings of length n,
2) for a string s of length n,s occurs t times in uiff s occurs t times inv.
Compute in O(u.length + v.length) time.
Expert Answer
An answer will be send to you shortly. . . . .