Turing Software Engineer Interview Questions and Answers

Find all duplicate pairs in given array of strings

• Create a hash table to store frequency of each string

• Iterate through the array and check if frequency is greater than 1

• Add the string to result if frequency is greater than 1

KMP algorithm finds the shortest substring that repeats to form the entire string.

• KMP algorithm uses a prefix table to find the longest proper prefix that is also a suffix of each substring.

• The length of the shortest repeating substring is the length of the string minus the length of the longest proper prefix.

• Example: For string 'abcabcabc', the longest proper prefix is 'abcabc' and the length of the shortest repeating