The first stage was two questions on Hackerrank, in which you get two hours to complete.

Then there is a video interview, a phone screen with HR, and virtual final round interviews.

First round:

1. Given the chessboard size, knight starting position, end position, and bishop position, find the minimum number of moves for the knight to move from its starting position to the end position. The knight cannot move on any square that the bishop is attacking, but it can go on those squares if the knight captures the bishop.

2. Implement a stack with the functions pop, push, inc, isEmpty, and peek. The inc function increases the first n elements of the stack by a value i.