Algorithm

Sort both the greed and cookieSize array. By sorting, we are able to pair the smallest cookies with the least greedy children, maximising overall content.
Use two pointers, l and r to iterate through the cookieSize and greed arrays. These pointers represent the positions of the smallest available cookie and the least greedy child.
We iterate through the arrays, checking if the current cookie can satisfy the current child’s greed. Ie. cookieSize[l] >= greed[r].
If the current cookie can satisfy the current child’s greed, we move to the next child.
Regardless of whether a child is satisfied or not, we move to the next cookie.
At the end, the value of r, represents the number of children that were satisfied as we increment it each time a child’s greed is satisfied. We return this value as the total number of satisfied children.