Input : Student = [1, 2, 3] , Cookie = [1, 1]
Output :1
Explanation : Only the first cookie (1) satisfies the first student (1), therefore only 1 student is content.

Input : Student = [1, 2] , Cookie = [1, 2, 3]
Output : 2
Explanation : Cookie 1 satisfies student 1 and cookie 2 satisfies student 2. Therefore, 2 students are content.

Disclaimer: Here is the practice link to help you assess your knowledge better. It's highly recommend trying to solve it before looking at the solution.

Memoization

Algorithm

We use recursion to try all ways of assigning cookies to children. At each step, if the current cookie can satisfy the current child, we try both: assigning it or skipping it, and take the better result. If it can't satisfy, we skip. To avoid recalculating the same subproblems, we store results in a 2D dp[child][cookie] array. This saves time by reusing already computed answers.

Sort both student and cookie array in ascending order.
Begin from the first student and the first cookie and at each step, check if the current cookie can satisfy the current student.
If the cookie can't satisfy the student, skip it and try the next one.
If yes, either give the cookie to the student and move to the next student and next cookie or skip the cookie and try giving the next one to the same student.
For every student-cookie pair, remember the result so you don’t recalculate it later. Repeat the process until you’ve considered all students or all cookies.

Code