Topic: Array Problem / Level: intermediate

Problem: Find the number of ways to partition an array into two subarrays such that the sum of elements in one subarray is a perfect square and the sum of elements in the other is a perfect cube.

Run the code to see the output here...