Split Array with Equal Sum
Given an integer array nums, determine whether there exist indices i < j < k that split the array into four non-empty parts (excluding nums[i], nums[j], nums[k]) with equal sums.
Given an integer array nums, determine whether there exist indices i < j < k that split the array into four non-empty parts (excluding nums[i], nums[j], nums[k]) with equal sums.