← Questions
Earliest time a password becomes irrecoverable
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding
