Is it possible to check if an array consisting of n integers(possibly equal) can be split in two equal with sum parts, in O(n^2) time?
No. Not with the information that you have provided.