Is there a way to do it more efficiently than brute force? websites like geeksforgeeks, stack overflow, and ELI5 say that brute forcing is the fastest way to find if a number can be represented as a sum of subarrays. The fastest way to find divisors is O(sqrt(N)). And with all of that just 44%, what is there to optimize?