codingstuff.io
ExploreTutorialsProblemsCS Subjects
Get Started
ExploreTutorialsProblemsCS Subjects
Get Started
codingstuff.io

Master the art of building software through interactive tutorials, real-world problems, and guided projects.

Pune, Maharashtra, India

codingstuffmail@gmail.com

Product

  • Explore
  • Tutorials
  • Problems
  • CS Subjects

Company

  • About
  • Contact
  • Privacy Policy
  • Terms & Conditions
  • Sitemap

© 2026 codingstuff.io. All rights reserved.

Built with ❤️ for developers everywhere

ProblemsRemove K Digits

Remove K Digits

Medium
StacksGreedy

Given string num representing a non-negative integer num, and an integer k, return the smallest possible integer after removing k digits from num.

 

Example 1:

Input: num = "1432219", k = 3
Output: "1219"
Explanation: Remove the three digits 4, 3, and 2 to form the new number 1219 which is the smallest.

Example 2:

Input: num = "10200", k = 1
Output: "200"

Example 3:

Input: num = "10", k = 2
Output: "0"

 

Constraints:

  • 1 <= k <= num.length <= 105
  • num consists of only digits.
  • num does not have any leading zeros except for the zero itself.

Related Problems

View all
Valid Parentheses
Easy•Stacks-queues
Min Stack
Medium•Stacks-queues
Evaluate Reverse Polish Notation
Medium•Stacks-queues
Generate Parentheses
Medium•Stacks-queues
Daily Temperatures
Medium•Stacks-queues
Car Fleet
Medium•Stacks-queues
Input:
num = "1432219", k = 3