Minimum Deletions to Make String Balanced: coding question

Available question text

Given a string of 'a' and 'b', delete the fewest characters so that no 'b' appears before any 'a' (i.e., all remaining 'a's precede all remaining 'b's). Return the minimum number of deletions (|s| ≤ 1e5).

Continue with questions that share topics or the same question type.

Minimum Deletions to Make String K-Special
Coding
Minimum Number of Swaps to Make the String Balanced
Coding
Minimum Additions to Make Valid String
Coding
Minimum Changes To Make Alternating Binary String
Coding

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

No company association
Leetcode 1653. Minimum Deletions to Make String Balanced
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

Minimum Deletions to Make String Balanced

Available question text

Related questions

Minimum Deletions to Make String Balanced

Available question text

Related questions