Write a program if some substring K that can be repeated N > 1 times to...

Transcribed Image Text:

Write a program if some substring K that can be repeated N > 1 times to produce the input string exactly as it appears. Your program should return longest substring K, and if there is none it should be return "There is no repetitive substring" For Example is str ="abcababcababcab" str="abcdefabcdef" str ="abcdefabcdefabcdefabcdef" str ="abcdefxabcdef" output should be abcab output should be abcdef output should be abcdefabcdef output should be "There is no epetitive substring" Write a program if some substring K that can be repeated N > 1 times to produce the input string exactly as it appears. Your program should return longest substring K, and if there is none it should be return "There is no repetitive substring" For Example is str ="abcababcababcab" str="abcdefabcdef" str ="abcdefabcdefabcdefabcdef" str ="abcdefxabcdef" output should be abcab output should be abcdef output should be abcdefabcdef output should be "There is no epetitive substring"

Answer rating: 100% (QA)

Answer Here is your correct code def longestrepetitivesubstrings n lens for i in rangen 2 0 1 Start ... View the full answer