---
title: "Discussion on \"(6) Binary Search: Split Array Largest Sum\" | Hashnode"
description: "Discussion on \"(6) Binary Search: Split Array Largest Sum\". Question Link  and  Solution Link \nDifficulty: Hard\nProblem Statement: Given an array of elements you need to split it into m subarrays such that the maximum sum of the subarray is minimized.\nApproach: Let mid be the maximum sum a particular sub-arra..."
url: "https://hashnode.com/posts/6-binary-search-split-array-largest-sum/61d71c999cea31197e02be6f"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [(6) Binary Search: Split Array Largest Sum](https://programminguides.hashnode.dev/6-binary-search-split-array-largest-sum?utm_source=hashnode&utm_medium=feed)

Question Link and Solution Link Difficulty: Hard Problem Statement: Given an array of elements you need to split it into m subarrays such that the maximum sum of the subarray is minimized. Approach: Let mid be the maximum sum a particular sub-arra...

Jan 6, 2022 · 1 min read · programminguides.hashnode.dev  
Read the article

-   [#data-structures](https://hashnode.com/tag/data-structures)
-   [#algorithms](https://hashnode.com/tag/algorithms)

## Written by

[Mohammad Arsalan](https://hashnode.com/@mohdarsalan)

@mohdarsalan · India

  
[View profile](https://hashnode.com/@mohdarsalan)

Web Developer

I am Computer Science Graduate and Web Developer.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.