Given a sequence string s and a word w, find the maximum value of k such that w concatenated k times is a substring of s. If w is not a substring of s, return 0.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.