Topic: Dynamic Programming Problem / Level: advanced

Problem: Solve the "2D Longest Increasing Subsequence in a Matrix" problem using dynamic programming.

Run the code to see the output here...