Leetcode 1653. Minimum Deletions to Make String Balanced

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).