[Leetcode] 2405. Optimal Partition of String

 

class Solution:
    def partitionString(self, s: str) -> int:
        substrings = []
        
        sub = ''
        for n in s:
            if n in sub:
                substrings.append(sub)
                sub = n
            else:
                sub += n
        
        substrings.append(sub)

        return len(substrings)

https://leetcode.com/problems/optimal-partition-of-string

Optimal Partition of String - LeetCode