[Custom]: <ADD A PROBLEM>Split Array Largest Sum to Top DSA interview questions

ajay-dhangar / algo

This repository contains a collection of data structures and algorithms implemented in various programming languages. It is designed to help learners understand key concepts through hands-on examples. Contributions and improvements are welcome!

https://ajay-dhangar.github.io/algo/

MIT License

70 stars 225 forks source link

[Custom]: <ADD A PROBLEM>Split Array Largest Sum to Top DSA interview questions #1785

Closed shriyadindi closed 3 weeks ago

shriyadindi commented 3 weeks ago

Issue Summary

Split Array Largest Sum

Issue Description

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

Proposed Solution (Optional)

No response

Priority

High - Requires urgent attention

Additional Context (Optional)

No response

ajay-dhangar commented 3 weeks ago

@shriyadindi, Please only open four PRs and issues at a time, or they will not be considered for evaluation.