Given a 2D board and a word, find if the word exists in the grid.
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.