Q. Divide the array into two parts, such that the difference between the sums of these two parts is minimized and the numbers of elements in these two parts differ by at most 1.\n\nConstraints:\nNumber of TestCases: 50 \nSize of array: 1 <= n <= 200\n\nAn easier version of the problem is without the size of partitions constraint. How to solve this one?\n\n

Q. Divide the array into two parts, such that the difference between the sums of these two parts is minimized and the numbers of elements in these two parts dif