#Matrix

Given a matrix, find the maximum sum path from top-left to bottom-right. You can only move right or down at any point in time. For example, given the matrix [[1, 2, 3], [4, 5, 6]], the maximum sum path is 1 → 2 → 5 → 6 = 14.

Given a binary matrix, find the maximum size square sub-matrix that contains all 1s. For example, given the binary matrix: 0 1 1 0 1 1 1 0 1 0 0 1 1 1 0 1 1 1 1 0 1 1 1 1 1 0 0 0 0 0 what would be the output?