Remove Trailing Zeros From a String - Practice Coding Problems

Remove Trailing Zeros From a String - Problem

String Easy

Given a positive integer num represented as a string, return the integer num without trailing zeros as a string.

Trailing zeros are the zeros at the end of a number. For example, the number "12300" has two trailing zeros.

Input & Output

Example 1 — Basic Case

$ Input: num = "51230"

› Output: "5123"

💡 Note: The string has one trailing zero. Remove it to get "5123".

Example 2 — Multiple Trailing Zeros

$ Input: num = "40300"

› Output: "403"

💡 Note: The string has two trailing zeros. Remove both to get "403".

Example 3 — No Trailing Zeros

$ Input: num = "123"

› Output: "123"

💡 Note: No trailing zeros to remove, return the original string.

Constraints

1 ≤ num.length ≤ 1000
num consists of only digits
num does not contain leading zeros

Visualization

Tap to expand

Understanding the Visualization

Input

String with trailing zeros

Process

Find last non-zero position

Output

String without trailing zeros

Key Takeaway

🎯 Key Insight: Work backwards from the end to efficiently find where to cut the string

Asked in

a Amazon 25 M Microsoft 18

The key insight is to work backwards from the end of the string to find the last non-zero character. Best approach uses a single pass to find the cutoff position and substring. Time: O(n), Space: O(1)

Common Approaches

Approach	Time	Space	Notes
✓ Character by Character Removal	O(k)	O(1)	Remove trailing zeros one character at a time using a loop
Find Last Non-Zero Position	O(n)	O(1)	Find the position of the last non-zero character and substring from start to that position

Character by Character Removal — Algorithm Steps

Start with the original string
Check if last character is '0'
If yes, remove it and repeat
Continue until last character is not '0'

Visualization

Tap to expand

Step-by-Step Walkthrough

Start

Original string with trailing zeros

Remove

Remove zeros one by one from the end

Result

Stop when non-zero character reached

Code -

solution.c — C

#include <stdio.h>
#include <string.h>

void solution(char* num) {
    int len = strlen(num);
    while (len > 1 && num[len - 1] == '0') {
        num[len - 1] = '\0';
        len--;
    }
}

int main() {
    char num[1000];
    fgets(num, sizeof(num), stdin);
    num[strcspn(num, "\n")] = 0;
    solution(num);
    printf("%s\n", num);
    return 0;
}

Time & Space Complexity

Time Complexity

⏱️

O(k)

Where k is the number of trailing zeros to remove

✓ Linear Growth

Space Complexity

O(1)

Only using a few variables, no extra data structures

✓ Linear Space

25.8K Views

Medium Frequency

~8 min Avg. Time

890 Likes

Ln 1, Col 1

Smart Actions

💡 Explanation

AI Ready

💡 Suggestion Tab to accept Esc to dismiss

// Output will appear here after running code

Code Editor Closed

Click the red button to reopen

Input & Output

Constraints

Visualization

Related Problems

Common Approaches

Character by Character Removal — Algorithm Steps

Visualization

Code -

Time & Space Complexity

Select Compiler