public static boolean isMatch_DP(String s, String p) {

    boolean[][] dp = new boolean[p.length() + 1][s.length() + 1];

    // if s == 0, set dp to true
    for (int i = 0 ; i <= p.length() ; i++) {
      // dp[i][0] = true;
    }
    dp[0][0] = true;

    // recursion is


    for (int i = 1 ; i <= p.length() ; i++) {
      for (int j = 1 ; j <= s.length() ; j++) {

      }
    }

    Util.printMatrix(dp);
    return dp[p.length()][s.length()];
  }