455. Assign Cookies¶
Edited by Charles
Easy · Python · Greedy
Problem
Read the original problem on LeetCode.
The official page contains the problem statement, examples, and constraints.
Explanation, examples & other approaches
Core idea
Start feeding from the child with the largest greed factor. Thus, sort g and s first. The logic is if the largest cookie cannot meet the current child’s greed. Iterate backwards to the child with the second largest greed until the greed is fulfilled.
Original study notes follow, including intermediate snippets and earlier attempts.
Note:
- Start feeding from the child with the largest greed factor. Thus, sort g and s first.
- The logic is if the largest cookie cannot meet the current child’s greed. Iterate backwards to the child with the second largest greed until the greed is fulfilled.
- The terminal condition of the pointers to children and cookies are both of them have to be non-negative.
Study record
| Field | Value |
|---|---|
| Attempts | 1 |
| Mastery | ❚ |
| The Latest Attempt | January 26, 2026 |
Python solution¶
class Solution:
def findContentChildren(self, g: List[int], s: List[int]) -> int:
g.sort()
s.sort()
result = 0
child, cookie = len(g) - 1, len(s) - 1
while child >=0 and cookie >= 0:
if s[cookie] >= g[child]:
result += 1
child -= 1
cookie -= 1
else:
child -= 1
return result