On-campus interview: Reverse a number (e.g., 12345 -> 54321) using only arithmetic and a loop. Discuss your projects.

Three back-to-back on-site interviews:

• Print a Binary Search Tree (BST) in-order.
• Partition an array of integers with odd integers to the left and even integers to the right.
• Create a queue data structure using two stacks.

Phone interview with a higher-up manager:

• The pirate game (see Wikipedia entry).

The hiring process took a bit longer than expected, but otherwise, things went smoothly.

Implement an online LRU cache to keep track of browser history.

(After the interview, I realized this was effectively what they were asking.)

For example, keep track of the 5 most recently seen items without duplicates.