NiCE Software Developer interview questions

explain about method Overloading in Java

You have an array of numbers, you are given a pointer to the head of the array For example : 4, 7, 12,10,15,8 What would be the logic to determine if An element in the array exists that satisfies the following rule: The sum of all the left elements is equal to the sum of all the right elements In this example 10 is such an element, the sum on the left & right is equal to 23 How to do it in the most efficient way?