TCS Digital Coding Question

#include <bits/stdc++.h>
using namespace std;
 
char f[21][21];
int n,m;
struct node{int a,b;};
bool valid(int x,int y) {return (x>=0&&y>=0&&x<n&&y<m);}
bool step(node temp){return (temp.a==-1&&temp.b==-1);}
int main()
{
    cin>>n>>m;
    int x,y,i,j,count=0;int ans=1;
    cin>>x>>y;x--;y--;
    for(i=0;i<n;i++)
        for(j=0;j<m;j++)
            cin>>f[i][j];
    f[x][y]='X';
 
   queue<node>q;
   node temp;
   temp.a=x;temp.b=y;
   q.push(temp);
   temp.a=-1;temp.b=-1;
   q.push(temp);
 
  while(!q.empty())
  {
      bool flag=false;
      while(!step(q.front()))
      {
        node count=q.front();
        if(valid(count.a+1,count.b)&&f[count.a+1][count.b]=='T')//a+1,b
        {
            if(flag==false){flag=true;ans++;}
            f[count.a+1][count.b]='X';
            count.a++;
            q.push(count);
            count.a--;
        }
        if(valid(count.a+1,count.b+1)&&f[count.a+1][count.b+1]=='T')//a+1,b+1
        {
           if(flag==false){flag=true;ans++;}
            f[count.a+1][count.b+1]='X';
            count.a++;count.b++;
            q.push(count);
            count.a--;count.b--;
        }
        if(valid(count.a+1,count.b-1)&&f[count.a+1][count.b-1]=='T')//a+1,b-1
        {
            if(flag==false){flag=true;ans++;}
            f[count.a+1][count.b-1]='X';
            count.a++;count.b--;
            q.push(count);
            count.a--;count.b++;
        }
        if(valid(count.a,count.b+1)&&f[count.a][count.b+1]=='T')//a,b+1
        {
            if(flag==false){flag=true;ans++;}
            f[count.a][count.b+1]='X';
            count.b++;
            q.push(count);
            count.b--;
        }
        if(valid(count.a,count.b-1)&&f[count.a][count.b-1]=='T')//a,b-1
        {
            if(flag==false){flag=true;ans++;}
            f[count.a][count.b-1]='X';
            count.b--;
            q.push(count);
            count.b++;
        }
         if(valid(count.a-1,count.b-1)&&f[count.a-1][count.b-1]=='T')//a-1,b-1
        {
            if(flag==false){flag=true;ans++;}
            f[count.a-1][count.b-1]='X';
            count.a--;count.b--;
            q.push(count);
            count.a++;count.b++;
        }
         if(valid(count.a-1,count.b+1)&&f[count.a-1][count.b+1]=='T')//a-1,b+1
        {
            if(flag==false){flag=true;ans++;}
            f[count.a-1][count.b+1]='X';
            count.a--;count.b++;
            q.push(count);
            count.a++;count.b--;
        }
         if(valid(count.a-1,count.b)&&f[count.a-1][count.b]=='T')//a-1,b
        {
            if(flag==false){flag=true;ans++;}
            f[count.a-1][count.b]='X';
            count.a--;
            q.push(count);
            count.a++;
        }
        q.pop();
      }
      q.pop();
      if(!q.empty())
      {
          temp.a=-1;
          temp.b=-1;
          q.push(temp);
      }
 
   /*
   cout<<endl;
   for(i=0;i<n;i++)
        {for(j=0;j<m;j++)
            {cout<<f[i][j]<<" ";}cout<<endl;}
            cout<<endl<<endl;
    */
  }
 cout<<ans;
}

ar=[]
n=0
br=[(-1,0),(+1,0),(0,+1),(0,-1),(-1,+1),(-1,-1),(+1,+1),(+1,-1)]
def bfs(i,j):
    key=(i,j)
    vis=set()
    vis.add(key)
    dis=dict()
    dis[key]=1 
    que=[]
    que.append((i,j))
    time=1
    while(que):
        x,y=que.pop(0) 
        for dx,dy in br:
            nx,ny=x+dx , y+dy 
            key=(nx,ny) 
            if(0<=nx<=n-1 and 0<=ny<=n-1 and key not in vis and ar[nx][ny]=='T'):
                vis.add(key)
                dis[key]=dis[(x,y)]+1 
                que.append((nx,ny)) 
                time=max(time,dis[key]) 
    return time
            
n,m=map(int,input().split())
r,c=map(int,input().split())
ar=[]
for i in range(n):
    ar.append(tuple(map(str,input().split()))) 
    
print(bfs(r-1,c-1))

import java.util.HashMap;
import java.util.Scanner;

class Temp {

    static void print(int [][] arr){
        for(int i=0;i<arr.length;i++){
            for (int j=0;j<arr[0].length;j++){
                System.out.print(arr[i][j]+"\t");
            }
            System.out.println();
        }
    }
    public static void main (String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int [][] array = new int[N][N];
        HashMap<Integer, Integer> map = new HashMap<>();

        int powerpoints = 1 + (N*N)/11;

        int counter = 1;
        int row = 0, col = 0; // for the current row/col that we are end
        int endRow = 0, endColumn = 0; // for the row/col where we need to stop

        map.put(0,0);

        for(int i=0;i<N/2;i++){
            row = col = i;
            endColumn = N-i-1;

            while (col < endColumn) {
                array[row][col] = counter;

                if (counter % 11==0)
                    map.put(row,col);

                counter++;
                col++;
            }
            endRow = N-i-1;
            while (row<endRow){
                array[row][col] = counter;
                if (counter % 11==0)
                    map.put(row,col);
                counter++;
                row++;
            }

            endColumn = i;
            while (col>endColumn){
                array[row][col] = counter;
                if (counter % 11==0)
                    map.put(row,col);
                counter++;
                col--;
            }

            endRow = i;
            while (row>endRow){
                array[row][col] = counter;
                if (counter % 11==0)
                    map.put(row,col);
                counter++;
                row--;
            }


        }
        if (N%2==1)
            array[N/2][N/2] = N*N;

        print(array);
        System.out.println("Total Power Points: " + powerpoints);
        for (Integer key: map.keySet()) {
            System.out.println("("+key+ ","+map.get(key)+")");

        }

    }

}