Search
⌘K

Leetcode 420. Strong Password Checker

Given a password string, compute the minimum number of insertions, deletions, or replacements needed to make it "strong" — length 6–20, containing at least one lowercase, one uppercase, and one digit, and with no three identical characters consecutively. The core challenge is optimally balancing length edits with fixes for missing character classes and runs of repeated characters to minimize total operations.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.