In this guide, you will get 455. Assign Cookies LeetCode Solution with the best time and space complexity. The solution to Assign Cookies problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
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.
Note: This question is the same as 2410: Maximum Matching of Players With Trainers.
Complexity Analysis
Time Complexity: O(\texttt{sort}(g) + \texttt{sort}(s))
Space Complexity: O(\texttt{sort}(g) + \texttt{sort}(s))
455. Assign Cookies LeetCode Solution in C++
class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
ranges::sort(g);
ranges::sort(s);
int i = 0;
for (const int cookie : s)
if (i < g.size() && g[i] <= cookie)
++i;
return i;
}
}; /* code provided by PROGIEZ */
455. Assign Cookies LeetCode Solution in Java
class Solution {
public int findContentChildren(int[] g, int[] s) {
Arrays.sort(g);
Arrays.sort(s);
int i = 0;
for (final int cookie : s)
if (i < g.length && g[i] <= cookie)
++i;
return i;
}
} // code provided by PROGIEZ
455. Assign Cookies LeetCode Solution in Python
class Solution:
def findContentChildren(self, g: list[int], s: list[int]) -> int:
g.sort()
s.sort()
i = 0
for cookie in s:
if i < len(g) and g[i] <= cookie:
i += 1
return i # code by PROGIEZ
