Freaks City

The problem involves finding the longest common substring between two strings composed solely of lowercase letters. The string lengths can reach up to 250,000. The solution uses binary search combined with hashing techniques to efficiently determine the maximum length of the shared substring. Let's denote the two input strings as $ s_1 $ and $ ...