I had two coding phone interviews but did not move forward to the team matching interview.

For each round, an engineer first introduced himself and asked a little about my experience. Then, they went to coding questions directly. I performed well in the first round but not as well in the second round.

The coding questions were not that hard for both rounds.

In the first round, the two questions were:

• Return the sum of the k-largest digits (0-9) in the array.
• Implement an LRU (Least Recently Used) cache.

In the second round, the two questions were:

• Return the index of the largest element. If more than one element reaches the maximum, pick one uniformly at random.
• Clone a directed, unweighted graph that is not necessarily fully connected.