Write a program to return the longest repeating substring in a string.
"How do you efficiently find the largest repeating string and the number of times it repeats in a given string? For example, given string ""abc fghi bc kl abcd lkm abcdefg"", the function should return string ""abcd"" and the count of 2.The emphasis is on the ""efficiency"""