Problem 686 · Medium

Repeated String Match

Find how many copies of a string must be placed end to end before a second string appears inside them. The visual stacks copies and slides the target across the joined text.

Open the interactive visualisation