← Walmart questions

Partition array into k subsets to minimize maximum subset sum

Filed under Walmart

Given an array of n integers and a number k, partition the array into k contiguous subsets (or general subsets depending on variation, usually continuous subarrays or partition into k groups) to…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Walmart questions

Collected from public candidate posts and coding forums. Updated Nov 2026.