Given children greed factors `g` and cookie sizes `s`, implement `findContentChildren(g, s)` returning the maximum number of children that can each get a cookie at least as large as their greed.
+ 1 hidden test run on Submit.
Sorting and a two-pointer match maximizes content children in O(n log n) time.
Run your code to see results.