DKodeTree Small Logo
DKodeTreeWhere logic takes root...!
Assign Cookies - Solution
Solutions and explanations
Link to Problem StatementView on GitHub

class Solution:
    def findContentChildren(self, greed_factors: List[int], cookie_sizes: List[int]) -> int:
        greed_factors.sort()
        cookie_sizes.sort()

        child_idx = 0 
        cookie_idx = 0 

        while child_idx < len(greed_factors) and cookie_idx < len(cookie_sizes):
            # Give cookie if it satisfies the child's greed
            if greed_factors[child_idx] <= cookie_sizes[cookie_idx]:
                child_idx += 1
            cookie_idx += 1
        return child_idx

Complexity Analysis

Here, n is the number of children, and m is the number of cookies.

  • Time Complexity: O(n log n + m log m)

    • O(n log n + m log m) for sorting, plus O(n + m) for traversal → overall O(n log n + m log m)

  • Space Complexity: O(n + m) or O(1)

    • Depending on the internal implementation of sorting: O(1) if sorting is in-place, otherwise O(n + m)