Earliest time a password becomes irrecoverable

0
Remix

A password is attacked one character at a time: you get the order in which positions are replaced by '*', one per second. The password counts as irrecoverable once at least m of its substrings contain at least one '*'. Return the earliest second at which that happens. Count substrings with a star without listing them, and use binary search on time or update the count as each star lands.

AmazonOnline assessmentLast asked Sep 2025
No answer yet. Write the first one; the best answer gets endorsed.