I applied through a recruiter.

They scheduled the first coding round on HackerRank. I am adding the questions asked in this online HackerRank test. The second one required a bit of thinking. Overall, the experience was okay.

Array of item prices: [5, 1, 3, 4, 6, 2]. Discount on each item is the first price to the right, lesser than or equal to its own price. If no such price is found, no discount is applicable. Print the total price and the indexes (0-index based) of items with the full price to be paid. For example, for the above example, the item discounts will be: [1, 0, 2, 2, 2, 0]. So, the final prices will be: [4, 1, 1, 2, 4, 2]. So, the answer will be: 14 (total price) 1 5 (1 and 5 have full prices to be paid).

Lift with $n$ floors. You can go up by lift any number of floors and then climb up by stairs the remaining floors. Going by lift increases your energy by $e1$ per floor and uses $t1$ time per floor. Climbing by stairs decreases your energy by $e2$ per floor and uses $\text{ceil}(c/E)$ time per floor, where $c$ is a constant and $E$ is your current energy. Find the minimum possible difference between the time taken in going by stairs and going by lift. Values of $n$, $e1$, $t1$, $e2$, and $c$ are given as part of the question.