1419. Minimum Number of Frogs Croaking (Medium) - TengnanYao/daily_leetcode GitHub Wiki

class Solution:
    def minNumberOfFrogs(self, croakOfFrogs: str) -> int:
        h = {c: 0 for c in "croak"}
        result = cur = 0
        for c in croakOfFrogs:
            if not h["c"] >= h["r"] >= h["o"] >= h["a"] >= h["k"]:
                return -1
            cur += (c == "c") - (c == "k")
            result = max(result, cur)
            h[c] += 1
        return result if len(set(h.values())) == 1 else -1