Day 5 Problem + Interview tips from Fiona from Folio

AuthorAuthor

Denisse Damian & Fiona
January 29, 2024

Hello and welcome back brave human being,

Before we delve into the problem, let me share something your auntie might not say: I'm proud of you! You've persevered through these challenging problems and consistently worked on self-improvement.

Efficiently distribute cookies among children (with greed factors represented by array g and cookie sizes by array s) to maximize contentment.

Let's set an example… 

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.

Which array would you sort to use the two-pointer technique?

Which array would you sort to use the two-pointer technique?

Login or Subscribe to participate in polls.

Remember: A LeetCode problem a day keeps unemployment away!

Cheers to your success,

Denisse

Interview tips from Fiona from Folio

Fiona L.

Fiona has over 3 years of marketing and product experience in B2B tech and startups and thrives at the intersection of creativity, analytics, and strategy. Currently, at Folio's product team, she brings insights from past roles at Intel and NVIDIA. Fiona is constantly sharing valuable early career tips and JOBS, make sure you follow her!

When asked what her best interview tips and tricks are…

❝

Try to figure out what team and product the role is focused on, asked questions related to recent launch/campaign/ challenges. This shows that you did research prior to the interview.

Fiona L.

Need motivation to be consistent?

Add this problem to your log and when the challenge is done send it to me! You’ll be in for a treat.

Reply

or to participate.