Topic: Array Problem / Level: intermediate

Problem: Find the number of ways to partition an array into three contiguous subarrays such that the sum of elements in the first subarray is twice the sum of the third subarray.

Run the code to see the output here...