Available question text
Given arrays g (children's greed) and s (cookie sizes), assign at most one cookie per child so that s[j] >= g[i] and maximize the number of content children. This is a greedy matching problem typically solved by sorting both arrays and using a two‑pointer scan to pair smallest sufficient cookies to children.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 455. Assign Cookies
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source