SDE - 2

import java.io.*;
import java.util.*;
public class Main
{
public static void DFS(int[][] input, int i, int j, int row, int col){
if(i<0||j<0||i>row-1||j>col-1){
return;
}
if(input[i][j]==1){
input[i][j]=0;
DFS(input,i+1,j,row,col);
DFS(input,i-1,j,row,col);
DFS(input,i,j+1,row,col);
DFS(input,i,j-1,row,col);
}
}

public static int countNumber(int[][] input, int row, int col){
int count =0;
for(int i=0;i {
for(int j=0;j if(input[i][j]==1){
input[i][j]=0;

count++;
System.out.println(i+" "+j);
DFS(input,i+1,j,row,col);
DFS(input,i-1,j,row,col);
DFS(input,i,j-1,row,col);
DFS(input,i,j+1,row,col);
}
}
}
return count;
}
public static void main(String[] args) {
//Scanner sc = new Scanner(System.in);
int row =5;
int col =5;
// row = sc.nextInt();
//col = sc.nextInt();
int[][] input = {
{1, 1, 0, 0, 0},
{1, 1, 0, 0, 1},
{1, 1, 1, 1, 1},
{1, 0, 1, 0, 1},
{1, 0, 1, 0, 1}};

System.out.println(countNumber(input,row,col));
}
}

Tip 1 : Provide correct answer i you know
Tip 2 : Revise Java concepts

Tip 1 : Practise System Design well
Tip 2 : Ask questions wherein necessary

Tip 1 : Be honest and authentic
Tip 2 : Watch videos on the behavioural round