Math, asked by saicheetirala, 15 days ago

Question
Moving Apples
There are N number of baskets, where the ith basket contains input2[iapples.
We want to move apples between baskets so that all baskets have the same number of
apples. What is the minimum number of apples that must be moved?
It is guaranteed that there exists a way to move apples so as to have an equal number of
apples in each basket.
Input Specification:
input1: N. denoting the Number of Baskets
input2: array representing the number of apples in the ith basket
Output Specification:
Return the minimum number of apples that must be moved so that all baskets
have the same number of apples
Example 1:
inputi: 2
meta​

Answers

Answered by jadejavijaysinh82
0

Answer:

get oh well kg DJ n HD d u KV f

Similar questions