Solution added.

Author: 149ps

30 Days September Challange/Week 1/4. Partition Labels/solution.py

@@ -0,0 +1,32 @@
+"""
+A string S of lowercase English letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one part, and return a list of integers representing the size of these parts.
+
+
+
+Example 1:
+
+Input: S = "ababcbacadefegdehijhklij"
+Output: [9,7,8]
+Explanation:
+The partition is "ababcbaca", "defegde", "hijhklij".
+This is a partition so that each letter appears in at most one part.
+A partition like "ababcbacadefegde", "hijhklij" is incorrect, because it splits S into less parts.
+
+
+Note:
+
+S will have length in range [1, 500].
+S will consist of lowercase English letters ('a' to 'z') only.
+"""
+class Solution:
+    def partitionLabels(self, S: str) -> List[int]:
+        hmap = {}
+        for i, char in enumerate(S):
+            hmap[char] = i
+        start, end, result = 0, 0, []
+        for i, char in enumerate(S):
+            end = max(end, hmap[char])
+            if i == end:
+                result.append(i - start + 1)
+                start = i + 1
+        return result