Find the maximum number of contiguous occurrences of smaller string s in a larger string l

Question

Say we have two strings s and l, and they only have characters \'a\' through \'z\' (lowercase English alphabet characters). The task is to find the maximum number of consecutive