The imbalance across a split
A load balancer divides a batch at one index and wants the difference between the two halves.
- Sum the values strictly left of `at`, and the values from `at` onward inclusive.
- The answer is the left sum minus the right sum.
- A cut at or before the start takes all the weight as the right side: negate the whole sum.
- A cut at or past the end leaves everything on the left: just the whole sum.
splitImbalance(values: list<int>, at: int) → int
Java needs a compiler and Drill does not host one yet, so this page is the reference rather than an exercise: the problem, worked examples, and the solution in full. To type it out, the same problem runs in Python.
Where you start
int splitImbalance(List<Integer> values, int at) {
}Worked examples
| Call | Result |
|---|---|
splitImbalance(Main.<Integer>ls(1, 2, 3, 4), 2) | -4 |
splitImbalance(Main.<Integer>ls(5, 3, 8), 1) | -6 |
splitImbalance(Main.<Integer>ls(1, 2, 3), 0) | -6 |
splitImbalance(Main.<Integer>ls(1, 2, 3), 3) | 6 |
Hint
Handle the out-of-range slices first, then sum each side and subtract.
Reference solution in Java
int splitImbalance(List<Integer> values, int at) {
int total = 0;
for (int v : values) total += v;
if (at <= 0) return -total;
if (at >= values.size()) return total;
int left = 0;
for (int i = 0; i < at; i++) left += values.get(i);
int right = 0;
for (int i = at; i < values.size(); i++) right += values.get(i);
return left - right;
}