What is the time and space complexity of Backspace String Compare?

Time complexity: O(n + m). Space complexity: O(1).

Backspace String Compare

Easy

Concept

Code

Loading editor...

Tap Analyze to see visualization

Click Analyze to visualize

See step-by-step execution, variables, and output

Variables

Run code to see variables

Output

Console output will appear here

Press Space to start•← → to step•? all shortcuts

Solution Guide: Backspace String Compare

Approach

Process both strings from the end. For each string, skip characters when encountering backspaces by counting consecutive # symbols. Compare the next valid characters from both strings. If they differ at any point, the strings are not equal.

Complexity Analysis

Time: O(n + m)
Space: O(1)

Pattern

Two Pointers (Reverse Traversal)

Why It Works

Processing from the end allows us to handle backspaces without extra space. Each # cancels the preceding character, and counting skips handles consecutive backspaces correctly.

Updated Mar 2026