Available question text
Given a final string produced when Alice may have long-pressed at most one key (extending a single run of identical characters), count how many original strings could yield it by grouping consecutive identical chars — each run of length k gives k-1 extra repeats, so the answer is 1 + sum(k-1) = 1 + n - number_of_runs.
Related questions
Continue with questions that share topics or the same question type.
- Find the Original Typed String II
Coding
- Check if an Original String Exists Given Two Encoded Strings
Coding
- Find All Anagrams in a String
Coding · Hash Table · Sliding Window · String
- Find And Replace in String
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 3330. Find the Original Typed String I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source