Update algorithms/search/binary_search/split_array_largest_sum/README.md

BrianLusina · coderabbitai[bot] · web-flow · commit 93845d3e678d · 2026-01-19T10:05:11.000+03:00
Co-authored-by: coderabbitai[bot] &lt;136622811+coderabbitai[bot]@users.noreply.github.com&gt;
diff --git a/algorithms/search/binary_search/split_array_largest_sum/README.md b/algorithms/search/binary_search/split_array_largest_sum/README.md
@@ -1,4 +1,4 @@
-#  Split Array Largest Sum
+# Split Array Largest Sum
 
 Given an integer list nums and an integer k, split nums into k non-empty subarrays such that the largest sum among these
 subarrays is minimized. The task is to find the minimized largest sum by choosing the split such that the largest sum of

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-# Split Array Largest Sum`
	`1`	`+# Split Array Largest Sum`
`2`	`2`
`3`	`3`	`Given an integer list nums and an integer k, split nums into k non-empty subarrays such that the largest sum among these`
`4`	`4`	`subarrays is minimized. The task is to find the minimized largest sum by choosing the split such that the largest sum of`