Amazon Interview Question for Software Developers
- 1of 1 vote
Given an array, coin of size n, coin[i] denotes the no. of coins on the position i. Can move any number of coins from the position i to (i+1) or (i-1). What is the minimum no. of moves required to redistribute the coins, so that each position i has at least 1 coin ?- 00pzz October 06, 2018 in India
Note: Summation of total coins on the array is exactly n.
| Report Duplicate | Flag | PURGE
Amazon Software Developer Arrays
Open Chat in New Window