Balance The Array

ArrayPrefix SumTwo Pointers

Given an array of integers, determine if it is possible to split the array into two subarrays such that the sum of the elements in both subarrays is the same. Return true if it is possible, otherwise return false.

Example 1

Input

Output

true

Explanation. We can split the array into [1, 2, 3, 4] and [10], where both subarrays have a sum of 10.

Example 2

Input

Output

false

Explanation. There is no way to split the array such that both sections have equal summation.

Example 3

Input

Output

true

Explanation. The array can be split into [10, -5] and [5, 10], where both have the sum of 5.

Example 4

Input

Output

true

Explanation. The array can be equally divided in multiple ways as all elements are zero.

Example 5

Input

Output

false

Explanation. It's not possible to split the array into two parts with equal sums.

Follow-up: How would you handle the case if the elements can also include floating point numbers?

Constraints:

1. The array will contain at least one element and at most 100 elements.\n2. Each array element is an integer between -1000 and 1000.

Views: 1