Have implemented the program to find the count of the balanced strings.

Author: rajgohil07

.idea/workspace.xml

@@ -0,0 +1,61 @@
+/*
+Split a String in Balanced Strings
+https://leetcode.com/problems/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.
+ */
+package com.raj;
+
+public class SplitAStringInBalancedStrings {
+    public static void main(String[] args) {
+        // Initialization.
+        String s = "RLRRLLRLRL";
+        int RCounter = 0;
+        int LCounter = 0;
+        int ans = 0;
+
+
+        // Logic.
+        for (int i = 0; i < s.length(); i++) {
+            if (s.charAt(i) == 'R') {
+                RCounter++;
+            } else {
+                LCounter++;
+            }
+            if (RCounter == LCounter) {
+                ans++;
+                LCounter = 0;
+                RCounter = 0;
+            }
+        }
+
+        // Display the result.
+        System.out.println("The balanced string count is: " + ans);
+    }
+}