We met at a career fair where they invited me to an on-campus technical interview the next week. I met the interviewer for a fort-five minute interview. The question was not very hard but the interviewer tried to lead me through the problem piece by piece which may have ended up taking up a lot of the forty five minutes. After the guiding questions such as traversing graphs and writing a quick function on calculating the different sides of the die given only 3 sides, I was asked to use pseudo code to write up the solution. I had about 15 minutes left. Afterwards, the interviewer asked if I had any questions and that I would get a response by the end of the week. At the end of the week, I got the verdict.

Given a square grid of any size and a six sided die which has the property of a constant sum for every pair opposing sides, find the smallest cost (sum of the numbers showing up on the top of the die) to get to some location elsewhere on the grid by rolling the die in that direction.

The die starts on the bottom left corner of the grid. Hints include representing the grid as a graph and possibly using depth first search.