Applied online and received an e-mail the following week to schedule a phone interview with a member from the R&D team and an online skills assessment.

The phone interview was fairly laid back, mostly focusing on past personal projects you have worked on, why you want to work for Epic, and basic behavioral questions. The interviewer was very friendly and continually engaged in conversation.

The skills assessment was taken through ProctorU and composed of 4 parts:

• 10 IQ questions to answer in 2 minutes
• A hypothetical new programming language that you have to answer some questions on it
• A math/logic section
• A 4-question programming section

It was not too hard, but the instructions say that you are graded on accuracy as well as speed for all parts, so it can be a bit intimidating. You are allowed scratch paper and a basic calculator. The new language section was a bit tricky, trying not to confuse the newly presented syntax with syntax you are already familiar with, but it is all multiple choice. The programming questions were the most difficult of the 4 parts but were not bad, although it is in a basic text editor (no syntax highlighting, auto-complete, or real-time error-checking) and you cannot compile it. If you do not know how to solve a question in the language of your choice, they allow you to write pseudocode for it.

I took the skills assessment first before my phone interview, as the HR representative I was speaking with recommended to expedite the process, and finished the phone interview a few days ago. They said it would be 1-2 weeks before I hear back from them about the results, so I am still waiting.

Programming Question: A grid of size M x N contains either 0 (empty), 1 (Player1), or 2 (Player2). Given a position in the grid, find the longest jump path. For a jump path, you can move horizontally or vertically. You can jump on an opponent's cell, and also the landing cell should be empty. No opponent cell can be jumped more than once. Write a function which takes the grid and a specific position in the grid, and returns the longest possible number of jumps in the grid.