1. take gifts from richest pile. array + k operations. each op: take from richest, leave floor(sqrt(taken)). return remaining total after k ops. max heap of pile sizes. pop, push back floor(sqrt). LC 2558 actually. ~25 min

Loading...

Something went wrong while trying to load the full version of this site. Try hard-refreshing this page to fix the error.

Squarespace - LC 2542 vibes

1.