Phone Screening (30 minutes)

This isn't important. Just don't say something inappropriate.

Technical Exam (2-4 hours)

This is the only part of the interview process that matters. It is honestly dumb. It is basically one of those fake "IQ Exams" where everything is a trick question.

• First section is 10 trick questions and you have 2 minutes to complete this portion.
• Second section is a "math" section but it is mostly trick questions. You get 30/45 minutes.
• Third section they teach you a fake programming language and have you answer questions about it. It is pretty straightforward if you know how to code and pay close attention. This section is 30/45 minutes I think.
• Final section is an actual programming section in any language. They are LeetCode type questions but nothing too crazy. I didn't need to know any data structures or complex algorithms. None of my algorithms were optimized; I used brute-force methods to solve each problem. I sort of forget the exact questions but here are 2 I remember. There were 3 total and you get about an hour on this portion.

Question 1: Verify that a string meets the proper formatting XX-XXX-XXXX and then reverse the 3 separate "sections" of the string. ie (12-345-6789 becomes 6789-345-12)

Question 2: There is a board with pieces. One player's pieces can jump over the other player's pieces to eliminate them. Write an algorithm to determine the minimum number of moves necessary to win the game.

Final Round (5 hours)

90% of this interview is an information session. There is a 45-minute case study. I was asked to implement a scheduling system from a high level. Basically, they asked how I would write a system that allows ER appointments to be scheduled and then the algorithm calls each person when they should leave and come to the appointment. It would have to consider distance to the person's house, when rooms are available, etc., etc. I don't think this was that important considering my interviewer showed up 15 minutes late and I didn't exactly solve the problem perfectly. (I literally just told them that I would need more time to implement something like this in reality)

Question 1: Verify that a string meets the proper formatting XX-XXX-XXXX and then reverse the three separate sections of the string. For example, 12-345-6789 becomes 6789-345-12.

Question 2: There is a board with pieces. One player's pieces can jump over the other player's pieces to eliminate them. Write an algorithm to determine the minimum number of moves necessary to win the game.