Google Software Engineer Tech Phone Screen: Minimize Maximum Path Value in 2D Array

Explore a Google software engineer technical phone screen problem: find the minimal maximum value on a path through a 2D integer array with bi-directional movement.