public boolean find(char[][] box, char[] str){
    int R = box.length; int C = box[0].length;
    int[][] dp = new int[R][C];
    int N = str.length;
   
   int max = -1;
   
   for(int k=0;k<N;k++){
    for(int i=0 ;i<R ;i++){
       for(int j=0; j<C ;j++){
           for (int x=-1;x<=1;x++){
               for (int y=-1;y<=1;y++){
                 if(!( (i+x)<R && (i+x>=0) &&
                       (j+y)<C && (j+y>=0)) || 
                       (x==0 && y==0))continue;
                  if( box[i+x][j+y]== str[k] 
                      && dp[i][j]==k ){
                     dp[i+x][j+y] =k+1;
                     max = Math.max(max,k+1);
                  }
               }
           }
         }
       }
    }
    if(max == str.length)return true;
    return false;
   }