Can someone help explain the difference when to use low <= high OR low < high for the while loop of binary search? I was doing this problem and I saw many different answers but I don't quite fully understand it.
Split Array Largest Sum