โ† Arcesium questions

Minimum string repetitions for subsequence

Filed under Arcesium

Given two strings A and B, find the minimum number of times string A must be repeated such that string B is a subsequence of the repeated string. If it's impossible, return -1.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Arcesium questions

Collected from public candidate posts and coding forums. Updated Nov 2026.