LeetCode Question · Nov 2019 · Los Angeles

Microsoft | OA 2019 | Partition array into N subsets with balanced sum

31 upvotes 39,782 views 25 replies

Question Details

Give you one sorted array, please put them into n buckets, we need to ensure we get n sub array with approximately equal weights. Example; input {1, 2, 3, 4,...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Arrays Sorting