Split Array Largest Sum | LeetCode Hard Problem 410

Split Array Largest Sum | LeetCode Hard Problem 410

The time complexity of the code is O(nlogn). Well, I tried to solve it taking two days but I could not solved it. So I took help from online resource and took the concept that is required to solved it and did it. I am learning too😥