1221. Split a String in Balanced Strings - LeetCode Solution


String Greedy Counting

Python Code:

class Solution:
    def balancedStringSplit(self, s: str) -> int:
        count = -1
        stack = []
        
        for i in range(len(s)):
            if not stack:
                count+=1
                stack.append(s[i])
            else:
                if stack[-1] != s[i]:
                    stack.pop()
                else:
                    stack.append(s[i])
        if not stack:
            count+=1
        return count


Comments

Submit
0 Comments
More Questions

Zoos
Build a graph
Almost correct bracket sequence
Count of integers
Differences of the permutations
Doctor's Secret
Back to School
I am Easy
Teddy and Tweety
Partitioning binary strings
Special sets
Smallest chosen word
Going to office
Color the boxes
Missing numbers
Maximum sum
13 Reasons Why
Friend's Relationship
Health of a person
Divisibility
A. Movement
Numbers in a matrix
Sequences
Split houses
Divisible
Three primes
Coprimes
Cost of balloons
One String No Trouble
Help Jarvis!