Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1653 with 23 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1653 # by problem number
lcpy gen -s minimum_deletions_to_make_string_balanced # by problem name
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.
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").
Input: s = "bbaaaaabb"
Output: 2
Explanation: The only solution is to delete the first two characters.
class Solution:
# Time: O(n)
# Space: O(1)
def minimum_deletions(self, s: str) -> int:
deletions = 0
b_count = 0
for char in s:
if char == "b":
b_count += 1
else:
deletions = min(deletions + 1, b_count)
return deletions
| Time | Space |
|---|---|
| O(n) | O(1) |