30-Days-DSA-Challenge icon indicating copy to clipboard operation
30-Days-DSA-Challenge copied to clipboard

Published 20 hours ago • verified publisher icon iamdestinychild

410. Split Array Largest Sum

Open Dhandeep10 opened this issue 1 year ago • 3 comments

Description

Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized.

Return the minimized largest sum of the split.

A subarray is a contiguous part of the array.

DSA Problem

https://leetcode.com/problems/split-array-largest-sum/description/

Dhandeep10 avatar Oct 03 '23 03:10 Dhandeep10

Hey @Dhandeep10 interested to work on this issue if possible can you assign it to me ?

suvraghosh avatar Oct 03 '23 06:10 suvraghosh

I have already completed this one in a PR

Dhandeep10 avatar Oct 03 '23 12:10 Dhandeep10

@Dhandeep10 I've complete this but i'm not able to push to the branch.

suvraghosh avatar Oct 03 '23 15:10 suvraghosh