Two HackerRank questions were presented. The first was alright and not too difficult.

The second was not as easy to find an optimal solution for; it involved some math.

Then, there was also a leadership principles questionnaire.

Two HackerRank questions.

One question is: given an identifier array, return the minimum operations to give unique consecutive identifiers.

The other question is: given n, find the sum of all numbers k such that floor(n/j) = k for some j.

Then, a leadership questionnaire.

This questionnaire has a bunch of personal questions. It requires reviewing Amazon's leadership principles.