1221. Split a String in Balanced Strings LeetCode Solution

In this guide, you will get 1221. Split a String in Balanced Strings LeetCode Solution with the best time and space complexity. The solution to Split a String in Balanced Strings problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Table of Contents

  1. Problem Statement
  2. Complexity Analysis
  3. Split a String in Balanced Strings solution in C++
  4. Split a String in Balanced Strings solution in Java
  5. Split a String in Balanced Strings solution in Python
  6. Additional Resources
1221. Split a String in Balanced Strings LeetCode Solution image

Problem Statement of Split a String in Balanced Strings

Balanced strings are those that have an equal quantity of ‘L’ and ‘R’ characters.
Given a balanced string s, split it into some number of substrings such that:

Each substring is balanced.

Return the maximum number of balanced strings you can obtain.

Example 1:

Input: s = “RLRRLLRLRL”
Output: 4
Explanation: s can be split into “RL”, “RRLL”, “RL”, “RL”, each substring contains same number of ‘L’ and ‘R’.

Example 2:

Input: s = “RLRRRLLRLL”
Output: 2
Explanation: s can be split into “RL”, “RRRLLRLL”, each substring contains same number of ‘L’ and ‘R’.
Note that s cannot be split into “RL”, “RR”, “RL”, “LR”, “LL”, because the 2nd and 5th substrings are not balanced.
Example 3:

Input: s = “LLLLRRRR”
Output: 1
Explanation: s can be split into “LLLLRRRR”.

Constraints:

2 <= s.length <= 1000
s[i] is either 'L' or 'R'.
s is a balanced string.

Complexity Analysis

  • Time Complexity:
  • Space Complexity:

1221. Split a String in Balanced Strings LeetCode Solution in C++

class Solution {
 public:
  int balancedStringSplit(string s) {
    int ans = 0;
    int count = 0;

    for (const char c : s) {
      count += c == 'L' ? 1 : -1;
      if (count == 0)
        ++ans;
    }

    return ans;
  }
};
/* code provided by PROGIEZ */

1221. Split a String in Balanced Strings LeetCode Solution in Java

N/A
// code provided by PROGIEZ

1221. Split a String in Balanced Strings LeetCode Solution in Python

N/A
# code by PROGIEZ

Additional Resources

Happy Coding! Keep following PROGIEZ for more updates and solutions.