Amazon Interview Experience | Set 256 (Written Test for SDE1)

Recently i had an online test at hackerank platform for Amazon SDE1 position.

Following are the questions

1. Given an unsorted array, trim the array such that twice of minimum is greater than maximum in the trimmed array. Elements should be removed either end of the array.

2. Given a value V, if we want to make change for V cents, and we have infinite supply of each of C = { C1, C2, .. , Cm} valued coins, what is the minimum number of coins to make the change?

All Practice Problems for Amazon !