public boolean balancedSplitExists(int[] arr) {
		Arrays.sort(arr);
		int i = 0;
		int j = arr.length - 1;
		int leftSum = arr[0];
		int rightSum = arr[arr.length-1];
		while(i <= j) {
			if(leftSum < rightSum) {
				i++;
				leftSum+=arr[i];
			}else if (leftSum > rightSum) {
				j--;
				rightSum+=arr[j];
			} else break;
		}
		if(j-i == 1) return true;
		else return false;
	}