I met them at a college career fair and was then invited to interview with them on campus. In this initial interview, they asked a fairly difficult question regarding strings that took almost the entire one-hour interview time. After this interview, I was invited to take a coding challenge on HackerRank. This coding challenge was 75 minutes long and included two coding questions:

• Determining if parentheses are balanced using a stack.
• A question regarding adjacency lists and minimum spanning trees.

The adjacency list and minimum spanning tree were fairly difficult. You're given a list of prisoners that are handcuffed together and must use this to determine how the prisoners are grouped.