Java program to find the index of the greater element whose value is sum of the remaining elements

[yash_java]

I need to write a java program to find the index of the element whose value is the sum of the remaining elements. can anyone help me with this ?

Recently I have been asked this question in an Interview which I couldnt solve properly.
Iam writing a cumbersome code for this program which is not at all satisfying even for me.

Thanks in advance !

[Ada Lovelace]

What have you tried so far to solve the problem? Post any code you have done with any problems
or errors and people can help you better

Wishes Ada xx

[yash_java]

This was my answer in the interview which made me rejected in the interview.

These are the steps I have followed in my piece of code,

step 1 : accepted 3 numbers (for simplicity)

step 2 : calucated biggest number of all

step 3 : stored the biggest number in the array list

step 4 : If the biggest number is the sum of the remaining returned the biggest number index otherwise I gave a message saying biggest number is not the sum of the remaining values.

I have just adjusted this program as I thought taking more numbers could give me a cumbersome logic which I couldnt write down even now. I just couldnt find a simple hint to write a simplified logic to solve this program.

[Norm]

Can you post a sample array and the desired index for that array?

[yash_java]

thank you for the response Norm !

here is a sample array,
int[] numberList = {100,100,100,100,900,100,100,100,100,100};

But it would be good if we can accept a random array from the user and based on that we write our logic and that is what is my problem which i couldnt resolve in my interview.

[Norm]

What would be the desired index for your example?

I would assume the search logic would be the same for any array.

Does "remaining" refer to all of the elements except the selected one?
For example: Given the array: {1,2,1} the desired index is 1

[yash_java]

For my example, program should return the index of the greatest number which is sum of the remaining i.,e '4' here !

We must write a program which finds the index of the highest number in the given list (whose value is the sum of all the remaining elements ). And yes remaining elements means all the remaining except the highest number of all. Am i making myself clear here ?

[Norm]

Ok, that sounds like it would work.

What problems or questions do you have writing the code?

[yash_java]

This is the approach I have followed to write that program.

These are the steps I have followed in my piece of code,

step 1 : accepted 3 numbers (for simplicity)

step 2 : calucated biggest number of all

step 3 : stored the biggest number first and remaining next in the array list

step 4 : If the biggest number is the sum of the remaining returned the biggest number index otherwise I gave a message saying biggest number is not the sum of the remaining values.

I have just adjusted this program as I thought taking more numbers could give me a cumbersome logic which I couldnt write down even now. I just couldnt find a simple hint to write a simplified logic to solve this program.

I think I couldnt find a simplified logic which can be applied to any 'n' numbers list given.

For example if user is giving 100 numbers the test I have conducted to check greater of three numbers will obviously become even more tedious. That piece of code Iam really not convinced with. So I thought of looking for alternative. I need a little hint or help on that. Thanks alot for your efforts in understanding and resolving my issue.

[Norm]

The number of numbers will not be a problem if the numbers are stored in a list or array and loops are used to look at the numbers.

[yash_java]

Ok thanks for the response !