LC-2405 Medium LeetCode

2405. Optimal Partition of String

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 78% Topics: Hash Table, String, Greedy

Reading material

Arrays & Hashing 12 min Strings 12 min Greedy 11 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(n)

# hash table
class Solution(object):
    def partitionString(self, s):
        """
        :type s: str
        :rtype: int
        """
        result, left = 1, 0
        lookup = {}
        for i, x in enumerate(s):
            if x in lookup and lookup[x] >= left:
                left = i
                result += 1
            lookup[x] = i
        return result

Solution from kamyu104/LeetCode-Solutions · MIT