We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 9339850 commit 78fe8b5Copy full SHA for 78fe8b5
lectures/10-binary search/code/src/com/kunal/SplitArray.java
@@ -10,7 +10,7 @@ public int splitArray(int[] nums, int m) {
10
int end = 0;
11
12
for (int i = 0; i < nums.length; i++) {
13
- start = Math.max(start, nums[i]); // in the end of the loop this will contain the max item fro the array
+ start = Math.max(start, nums[i]); // in the end of the loop this will contain the max item of the array
14
end += nums[i];
15
}
16
0 commit comments