Applied online through their website. Got HackerRank after a week, and a one-way video interview a few days later.

One HackerRank question was the minimum number of moves for a knight given a bishop on the chessboard. Another was the implementation of a new stack class with two new functions.

Still waiting on results after the video round.

Is the total number of distinct unsigned 32-bit integers different from the total number of signed 32-bit integers?

Can an O(1) algorithm get faster?

Is a task on 2 threads always faster than a task running on one thread?

How would you explain the difference between a stack and queue to a non-technical person? (More than one minute was given to prepare and 2 minutes to answer for this one)

Do similar hash keys have similar hashcodes?