Mar 30

Author: siddydutta

2025-03-March-LeetCoding-Challenge/Partition Labels.py

@@ -0,0 +1,25 @@
+class Solution:
+    def partitionLabels(self, s: str) -> list[int]:
+        last = {ch: idx for idx, ch in enumerate(s)}
+        result = [0]
+        ptr = 0
+        while ptr < len(s):
+            end = last[s[ptr]]
+            while ptr <= end:
+                ch = s[ptr]
+                end = max(end, last[ch])
+                ptr += 1
+            result.append(ptr)
+        return [result[idx] - result[idx-1] for idx in range(1, len(result))]
+
+
+def main():
+    s = 'ababcbacadefegdehijhklij'
+    assert Solution().partitionLabels(s) == [9, 7, 8]
+
+    s = 'eccbbbbdec'
+    assert Solution().partitionLabels(s) == [10]
+
+
+if __name__ == '__main__':
+    main()

2025-03-March-LeetCoding-Challenge/README.md

@@ -32,14 +32,14 @@
 | March 26 | [2033. Minimum Operations to Make a Uni-Value Grid](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/) | Medium | Solved |
 | March 27 | [2780. Minimum Index of a Valid Split](https://leetcode.com/problems/minimum-index-of-a-valid-split/) | Medium | Unsolved |
 | March 28 | [2503. Maximum Number of Points From Grid Queries](https://leetcode.com/problems/maximum-number-of-points-from-grid-queries/) | Hard | Unsolved |
-| March 29 | []() |  |  |
-| March 30 | []() |  |  |
+| March 29 | [2818. Apply Operations to Maximize Score](https://leetcode.com/problems/apply-operations-to-maximize-score/) | Hard | Unsolved |
+| March 30 | [763. Partition Labels](https://leetcode.com/problems/partition-labels/) | Medium | Solved |
 | March 31 | []() |  |  |
 
 
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 6 | 6 | 0 |
-| Medium | 20 | 9 | 11 |
-| Hard   | 2 | 0 | 2 |
+| Medium | 21 | 10 | 11 |
+| Hard   | 3 | 0 | 3 |