You are given two integer arrays:

1. greed_factors: This array represents the minimum cookie size required for each child to be content. Specifically, greed_factors[i] denotes the minimum cookie size that child i will accept to be satisfied.

2. cookie_sizes: This array represents the sizes of the available cookies. For example, cookie_sizes[j] denotes the size of cookie j.

Your objective is to distribute the cookies in a way that maximizes the number of content children. A child i is content if they receive a cookie that is at least as large as their greed factor, i.e., cookie_sizes[j] >= greed_factors[i]. Each child can be assigned at most one cookie, which can only be given to one child.

Write an algorithm to maximize the number of children who can be content by assigning available cookies appropriately.

Constraints:

• $1 \leq$ greed_factors.length $\leq 1000$

• $0 \leq$ cookie_sizes.length $\leq 1000$

• $1 \leq$ greed_factors[i], cookie_sizes[j] $\leq 10^5$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.