The interview consisted of two rounds, both of which were technical.

The first round included basic questions on arrays and linked lists. The second round featured one question based on dynamic programming.

Implement a linked list.

Two friends are playing a game. In the game, they can pick up coins of different values from the front or end of an array, one by one. Player 1 goes first, then Player 2, then Player 1 again, and so on. If Player 1 starts first, who will get more money if both play optimally?

This is a question based on game theory.