Assign Cookies · Coding Interview Practice

Assign CookiesEach child i has a greed factor g[i], the minimum cookie size that satisfies them, and each cookie j has a size s[j]. A cookie goes to at most one child. Return the maximum number of children you can satisfy.Constraints

1 <= g.length <= 3 * 10^4

0 <= s.length <= 3 * 10^4

1 <= g[i], s[j] <= 2^31 - 1

Examples

Input: g = [1, 2, 3], s = [1, 1] Output: 1

Input: g = [1, 2], s = [1, 2, 3] Output: 2

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…