Your question is Dynamic Programming Bottom-Up Solution. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Tell me about a time you solved a problem using dynamic programming with a bottom-up approach that updates a 1-D array with minimum path sums.