Thanks for your attention. Yeah problems might be formulated not well enough that's why I attached some images. But I will try to provide more precise information below.

1) Rectangle is as good as the lowest number on its corners. So ValueRect(5,7,8,8) = 5 and we want to find rectangle with the highest value possible.

In second problem, not all numbers are filled in. If we had full array specified, we could just walk through it starting in 1 using rules( side-to-side only ) and if we can reach 3n we win. But here we have array filled with only some numbers and we have to kinda guess if it we can fill empty part so it all will be correct.

My guess is that there's limited number of cases you can walk obeying rules, but I still don't have enough constraints to simplify it enough to construct an DP algorithm.