Leetcode 455. Assign Cookies

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.