Algorithm

Declare a dp[] array of size [m][n], where m and n are the dimensions of the grid. This array stores the results of subproblems, where dp[i][j] represents the total number of ways to reach from (0,0) to (i,j).
Initially, fill the dp array with -1 to indicate that no subproblem has been solved yet.
While encountering an overlapping subproblem, check if the value in dp[i][j] is not -1. If the value is not -1, it means this subproblem has already been solved, and you can directly return the stored value from the dp array instead of recalculating it.
Whenever a subproblem is encountered and it is not solved yet (i.e., the value at dp[i][j] is -1), calculate the value of the subproblem and store it in the dp array for future reference. This ensures that future overlapping subproblems can be solved in constant time by retrieving the value from the array.

Code

#include <bits/stdc++.h>
using namespace std;

class Solution {
private:
    //Function to solve the problem using recursion
    int func(int i, int j, vector<vector<