LeetCode 3174: Clear Digits Solution

Master LeetCode problem 3174 (Clear Digits), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

3174. Clear Digits

Easy

String Stack Simulation

Problem Explanation

Explanation:

To solve this problem, we can use a stack data structure to keep track of characters in the input string. We iterate through the characters of the input string and for each character:

If it is a digit, we pop the top element from the stack.
If it is a non-digit character, we push it onto the stack.

After processing all characters, the remaining elements in the stack will give us the resulting string without any digits.

Algorithm:

Initialize an empty stack.
Iterate through each character in the input string:
- If the character is a digit, pop the top element from the stack.
- If the character is a non-digit character, push it onto the stack.
Construct the resulting string by joining the elements left in the stack.
Return the resulting string.

Time Complexity:

The time complexity of this approach is O(n), where n is the length of the input string.

Space Complexity:

The space complexity is also O(n) due to the stack we are using.

Solution Code

import java.util.Stack;

class Solution {
    public String clearDigits(String s) {
        Stack<Character> stack = new Stack<>();
        
        for (char c : s.toCharArray()) {
            if (Character.isDigit(c)) {
                if (!stack.isEmpty()) {
                    stack.pop();
                }
            } else {
                stack.push(c);
            }
        }
        
        StringBuilder sb = new StringBuilder();
        while (!stack.isEmpty()) {
            sb.insert(0, stack.pop());
        }
        
        return sb.toString();
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 3174 (Clear Digits)?

This page provides optimized solutions for LeetCode problem 3174 (Clear Digits) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 3174 (Clear Digits)?

The time complexity for LeetCode 3174 (Clear Digits) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 3174 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 3174 in Java, C++, or Python.

Back to LeetCode Solutions