← All problemsSign in

Play with Strings

We define the following: A substring of a string is a contiguous segment of the string's "aka" characters. For example, the substrings of string "aka" are "a", "k", "a", "ak", "ka", and "aka". F(a,b) is the length of the longest substring of string a that occurs at least once as a substring of string b. For example, F("sadas", "faradast") is 4 because "adas" contains four characters and is the l

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start