Solving Split a String in Balanced Strings in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Return the maximum amount of splitted balanced strings.

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 = "RLLLLRRRLR"
Output: 3
Explanation: s can be split into "RL", "LLLRRR", "LR", each substring contains same number of 'L' and 'R'.

Example 3:

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

Constraints:

  • 1 <= s.length <= 1000

  • s[i] = 'L' or 'R'

  • 1 <= s.length <= 1000

See the full details of the problem Split a String in Balanced Strings at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go