Available question text
Given a string of lowercase letters and digits, repeatedly remove each digit together with the nearest non-digit to its left until no digits remain, and return the final string. This can be solved by simulating a stack/greedy left-pairing: when you see a digit, pop the most recent letter to its left.
Related questions
Continue with questions that share topics or the same question type.
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 3174. Clear Digits
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source