DFS public static void dfs(int x,int y) { if(y==size) { y=0; x++; } if (cnt == virus) { bfs(array); } Stack stack = new Stack(); while(x= size) continue; if (arr[nx][ny] == 0 && visited[nx][ny] == false) { q.offer(new int[] { nx, ny, time + 1 }); arr[nx][ny] = time + 1; visited[nx][ny] = true; } } } int max = -9999999; boolean check=true; for (int i = 0; i < size; i++) { for (int j = 0; j < size..