# Problem statement - 


"""
Complexity analysis:

1) Time complexity: 

2) Space complexity: 
"""

# Note: Problem seems similar to state value maximisation algorithms in reinforcement learning

class Solution:
    def minPathSum(self, grid: List[List[int]]) -> int:
        



if __name__ == '__main__':

    minPSum = Solution()

    # Test Case 1
    ip1 = [[1,3,1],
           [1,5,1],
           [4,2,1]]
    assert minPSum.minPathSum(ip1) == 7

