Q1. Given a 2D matrix filled with positive numbers. We can move in any of the 4 directions, if the value stored at that location is greater than the value at the present location. And each cell can be visited once in a specific path. We had to print the maximum sum we can get.

Q2. We had to print the number of good numbers in the range [A,B]. And, a number is good number, if the sum of a subset of its digit is exactly equal to the the sum of all its digits.