You are given an MxN board where each cell consists of a non-negative integer value representing the height of the cell.
We define an effort of the path as the maximum difference between two consecutive cells in that path.
You are situated in the top-left corner and you can move in 4 directions (up, down, left or right).
Write a function that returns the minimal effort for a path from top-left to bottom-right corner.