I got some 2D directional array questions. The question was on dynamic programming. I don't remember the exact question, but the interviewer didn't speak clear English, so it was hard to ask clarifying questions.

It was something like this: You are given an integer array cost, where cost[i] represents the cost of stepping on position i. You may start at index 0 or index 1. From any position, you may move forward either:

• One step
• Two steps Your goal is to move beyond the final index while paying the minimum possible total cost.