minimum-deletions-to-make-string-balanced

< Previous 　　　　　　　　　　　　　　　　 Next >

1653. Minimum Deletions to Make String Balanced (Medium)

You are given a string s consisting only of characters 'a' and 'b'​​​​.

You can delete any number of characters in s to make s balanced. s is balanced if there is no pair of indices (i,j) such that i < j and s[i] = 'b' and s[j]= 'a'.

Return the minimum number of deletions needed to make s balanced.

 

Example 1:

Input: s = "aababbab"
Output: 2
Explanation: You can either:
Delete the characters at 0-indexed positions 2 and 6 ("aababbab" -> "aaabbb"), or
Delete the characters at 0-indexed positions 3 and 6 ("aababbab" -> "aabbbb").

Example 2:

Input: s = "bbaaaaabb"
Output: 2
Explanation: The only solution is to delete the first two characters.

 

Constraints:

• 1 <= s.length <= 105
• s[i] is 'a' or 'b'​​.

Related Topics

[Greedy] [String]

Hints

Hint 1

You need to find for every index the number of Bs before it and the number of A's after it

Hint 2

You can speed up the finding of A's and B's in suffix and prefix using preprocessing