it have O(n*n), because sums recalculated for every element of array. and algorithm can't stop on right answer
This implementation does not protect you from fat finger errors and may therefore be considered bad practice.
What parallel is here for?
Almost exact duplicate of my solution. Nice.
Like the idea of your final char
In the example test the arguments of assertArrayEquals() should be swapped: expected first, actual second.