Sync LeetCode submission Runtime - 0 ms (100.00%), Memory - 17.8 MB (16.51%)

Author: jimit105

1537-maximum-score-after-splitting-a-string/README.md

@@ -0,0 +1,41 @@
+<p>Given a&nbsp;string <code>s</code>&nbsp;of zeros and ones, <em>return the maximum score after splitting the string into two <strong>non-empty</strong> substrings</em> (i.e. <strong>left</strong> substring and <strong>right</strong> substring).</p>
+
+<p>The score after splitting a string is the number of <strong>zeros</strong> in the <strong>left</strong> substring plus the number of <strong>ones</strong> in the <strong>right</strong> substring.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> s = &quot;011101&quot;
+<strong>Output:</strong> 5 
+<strong>Explanation:</strong> 
+All possible ways of splitting s into two non-empty substrings are:
+left = &quot;0&quot; and right = &quot;11101&quot;, score = 1 + 4 = 5 
+left = &quot;01&quot; and right = &quot;1101&quot;, score = 1 + 3 = 4 
+left = &quot;011&quot; and right = &quot;101&quot;, score = 1 + 2 = 3 
+left = &quot;0111&quot; and right = &quot;01&quot;, score = 1 + 1 = 2 
+left = &quot;01110&quot; and right = &quot;1&quot;, score = 2 + 1 = 3
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> s = &quot;00111&quot;
+<strong>Output:</strong> 5
+<strong>Explanation:</strong> When left = &quot;00&quot; and right = &quot;111&quot;, we get the maximum score = 2 + 3 = 5
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> s = &quot;1111&quot;
+<strong>Output:</strong> 3
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>2 &lt;= s.length &lt;= 500</code></li>
+	<li>The string <code>s</code> consists of characters <code>&#39;0&#39;</code> and <code>&#39;1&#39;</code> only.</li>
+</ul>

1537-maximum-score-after-splitting-a-string/solution.py

@@ -0,0 +1,21 @@
+# Approach 2: Count Left Zeros and Right Ones
+
+# Time: O(n)
+# Space: O(1)
+
+class Solution:
+    def maxScore(self, s: str) -> int:
+        ones = s.count('1')
+        zeros = 0
+        ans = 0
+
+        for i in range(len(s) - 1):
+            if s[i] == '1':
+                ones -= 1
+            else:
+                zeros += 1
+
+            ans = max(ans, ones + zeros)
+
+        return ans
+