LeetCode — Find Content Children

Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie.

Each child i has a greed factor g[i], which is the minimum size of a cookie that the child will be content with; and each cookie j has a size s[j]. If s[j] >= g[i], we can assign the cookie j to the child i, and the child i will be content. Your goal is to maximize the number of your content children and output the maximum number.

Example 1:

Input: g = [1,2,3], s = [1,1]
Output: 1
Explanation: You have 3 children and 2 cookies. The greed factors of 3 children are 1, 2, 3.
And even though you have 2 cookies, since their size is both 1, you could only make the child whose greed factor is 1 content.
You need to output 1.

Example 2:

Input: g = [1,2], s = [1,2,3]
Output: 2
Explanation: You have 2 children and 3 cookies. The greed factors of 2 children are 1, 2.
You have 3 cookies and their sizes are big enough to gratify all of the children,
You need to output 2.

Solutions:

Time Complexity: O(n * logn)

Space Complexity: O(1)

--

--

--

Dell Technologies — VxRail Software Engineer 👨‍💻

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Environment sensing using IoT

Discover Weekly — 22. Feb

Kiali releases 1.29 and 1.30: Feature update

Hide Your Passwords Using Environment Variables

LeetCode — Range Sum Query Immutable

Lab 7: DC Motors

How to develop an idea of NFT collection?

Your First Programming Language

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Steven Lu

Steven Lu

Dell Technologies — VxRail Software Engineer 👨‍💻

More from Medium

Graph Algorithm — Cycle Detection in Undirected Graph using BFS

Leetcode Q#217-Contains Duplicate

Implement PageRank Algorithm

1038. Binary Search Tree to Greater Sum Tree | LeetCode | Medium | Java