hard20 pts · first answer countssorting-and-searching
Split an array to minimise the largest sum
Split [7, 2, 5, 10, 8] into 2 non-empty continuous parts so the larger part's sum is as small as possible. What is that smallest possible maximum?
Discussion 0
Join free to post in the discussion.
Related questions
- Bubble sort best case with early exitBackend Developer
- What a stable sort meansBackend Developer
- Merge sort time in every caseBackend Developer
- Best simple sort for nearly sorted dataBackend Developer
- Swaps made by selection sortBackend Developer
- What in-place sorting meansBackend Developer
- Quick sort worst-case timeBackend Developer
- JavaScript default sort on numbersBackend Developer