DSA Crash Course [Part 77] - Max Path Sum Approach

In this lesson, Alvin explores the strategy to solving the following interview problem:

Write a function, max_path_sum, that takes in a grid as an argument. The function should return the maximum sum possible by traveling a path from the top-left corner to the bottom-right corner. You may only travel through the grid by moving down or right.

You can assume that all numbers are non-negativ