Problem Submissions Solution
Equal Sum Subarrays
Difficulty: Easy
Acceptance: %
Points: 20.00
Given an array of integers arr, return true if it is possible to split it in two subarrays (without reordering the elements), such that the sum of the two subarrays are equal. If it is not possible then return false.
Examples:
NA
Constraints:
- 1<=arr.size()<=10^5
- 1<=arr[i]<=10^6
Companies:
Meta
Topics:
Queue
