Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Strong Password Checker II
Coding
- Bad Word Checker
Coding
- Height Checker
Coding
- Maximum Strong Pair XOR I
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 420. Strong Password Checker
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source