Available question text
Given a numeric string, remove exactly k digits (preserving the remaining order) to form the smallest possible integer, trimming leading zeros and returning "0" if nothing remains. This is a greedy/monotonic-stack style problem where you remove digits that create larger prefixes to minimize the result under the constraint k ≤ n.
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
Amazon
Leetcode 402. Remove K Digits
Interview reported: Nov 19, 2024 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View source