Skip to content
LC-1419 Medium LeetCode

1419. Minimum Number of Frogs Croaking

Read the full problem statement on LeetCode.
Difficulty: medium Acceptance: 51% Topics: String, Counting
View full problem on LeetCode
Reference solution (spoiler · python)
# Time:  O(n)
# Space: O(1)

class Solution(object):
    def minNumberOfFrogs(self, croakOfFrogs):
        """
        :type croakOfFrogs: str
        :rtype: int
        """
        S = "croak"
        lookup = [0]*len(S)
        result = 0
        for c in croakOfFrogs:
            i = S.find(c)
            lookup[i] += 1
            if lookup[i-1]:
                lookup[i-1] -= 1
            elif i == 0:
                result += 1
            else:
                return -1
        return result if result == lookup[-1] else -1

Solution from kamyu104/LeetCode-Solutions · MIT