solves maximum score after splitting a string

Author: anishLearnsToCode

README.md

@@ -360,7 +360,7 @@
 | 1408 | [String Matching In An Array](https://leetcode.com/problems/string-matching-in-an-array)                                                             |                                                             [![Java](assets/java.png)](src/StringMatchingInAnArray.java)                                                             |                                                                                                                                   |
 | 1413 | [Minimum Value To Get Positive Step By Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum)                       |                                                     [![Java](assets/java.png)](src/MinimumValueToGetPositiveStepByStepSum.java)                                                      |                                                                                                                                   |
 | 1417 | [Reformat The String](https://leetcode.com/problems/reformat-the-string)                                                                             |                                                                [![Java](assets/java.png)](src/ReformatTheString.java)                                                                |                                                                                                                                   |
-| 1422 | [Maximum Score After Splitting A String](https://leetcode.com/problems/maximum-score-after-splitting-a-string)                                       |                                                                                                                                                                                      |                                                                                                                                   |
+| 1422 | [Maximum Score After Splitting A String](https://leetcode.com/problems/maximum-score-after-splitting-a-string)                                       |                                                        [![Java](assets/java.png)](src/MaximumScoreAfterSplittingAString.java)                                                        |                                                                                                                                   |
 | 1426 | [Counting Elements](https://leetcode.com/problems/counting-elements)                                                                                 |                                                                                                                                                                                      |                                                                                                                                   |
 | 1427 | [Performing String Shifts](https://leetcode.com/problems/perform-string-shifts)                                                                      |                                                                                                                                                                                      |                                                                                                                                   |
 | 1431 | [Kids With The Greatest Number Of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies)                                   |                                                                                                                                                                                      |                                                                                                                                   |

src/MaximumScoreAfterSplittingAString.java

@@ -0,0 +1,20 @@
+public class MaximumScoreAfterSplittingAString {
+    public int maxScore(String s) {
+        final int ones = getFrequency(s, '1');
+        int score = 0;
+        for (int index = 0, left = 0, right = ones ; index < s.length() - 1 ; index++) {
+            left += s.charAt(index) == '0' ? 1 : 0;
+            right -= s.charAt(index) == '0' ? 0 : 1;
+            score = Math.max(score, left + right);
+        }
+        return score;
+    }
+
+    private int getFrequency(String s, char character) {
+        int frequency = 0;
+        for (int index = 0 ; index < s.length() ; index++) {
+            if (s.charAt(index) == character) frequency++;
+        }
+        return frequency;
+    }
+}