Given a two 2D integer array, find the max score of a path from the upper left cell to bottom right cell that doesn't visit any of the cells twice. The score of a path is the minimum value in that path.
This is a companion discussion topic for the original entry at https://algo.monster/problems/maximum_minimum_value_path_ii/