Find Number of Islands - The Coding Shala

Home >> Interview Questions >> Find number of Islands

Find Number of Islands

Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.
Example 1:

Input:

11110

11010

11000

00000

Output: 1



Example 2:

Input:
11000
11000
00100
00011
Output: 3

Number of Islands Java Program

Method 1:
Using dfs.

An Island is started if there is 1 present and surrounded by water(0). we will count island if 1 available and make all the adjacent to zero(0) or sink adjacent island so we don't count them again. We can use dfs or bfs to check adjacent lands. The following code is using dfs.

Java Code: 

class Solution {
    public int numIslands(char[][] grid) {
        //check if null or no element
        if(grid == null || grid.length == 0) return 0;
        int numIsland = 0;
        //check for every element
        for(int i=0; i<grid.length; i++){
            for(int j=0; j<grid[i].length;j++){
                //if there is 1 then only it can make an island
                if(grid[i][j]=='1'){
                    //make all the adjcent island to zero or sink :P
                numIsland += dfs(grid, i, j);
                }
            }
        }
        return numIsland;
    }
    
    private int dfs(char[][] grid, int i, int j){ //check all the adjcent island
        if(i<0 || i>=grid.length || j<0 || j>=grid[i].length || grid[i][j]=='0'){
            return 0;
        }
        grid[i][j] = '0'; //sink all the island
        dfs(grid, i-1, j);
        dfs(grid, i+1, j);
        dfs(grid, i, j-1);
        dfs(grid, i, j+1);
        return 1;
    }
}
Method 2:
Using bfs.
We will bfs to visit the adjacent island.

Java Code: 

class Solution {
    //for storing purpose bfs
    Queue<int[]> queue = new LinkedList<>();
    
    public int numIslands(char[][] grid) {
        if(grid == null || grid.length==0) return 0;
        int numIsland = 0;
        int m = grid.length;
        int n = grid[0].length;
        boolean[][] visited = new boolean[m][n];
        
        for(int i=0; i<m; i++){
            for(int j=0; j<n; j++){
                if(grid[i][j]=='1' && !visited[i][j]){
                    queue.offer(new int[]{i,j});
                    visited[i][j] = true;
                    bfs(grid, visited);
                    numIsland++;
                }
            }
        }
        return numIsland;
    }
    
    //bfs
    void bfs(char[][] grid, boolean[][] visited){
        int[][] direction = {{-1, 0}, {1,0}, {0,-1}, {0,1}};
        while(!queue.isEmpty()){
        int[] current = queue.poll();
        for(int[] dir : direction){
            int i = current[0]+dir[0];
            int j = current[1]+dir[1];
            
            if(i<0 || i>= grid.length || j<0 || j>= grid[i].length 
                   || visited[i][j] || grid[i][j]=='0'){
                continue;
            }
            visited[i][j] = true;
            queue.offer(new int[]{i,j});
         }
        }
    }
}

Here DFS is fast compared to the BFS.


Other Posts You May Like
Please leave a comment below if you like this post or found some error, it will help me to improve my content.
By

Comments

Post a Comment

Popular Posts from this Blog

Java Program to Convert Binary to Decimal - The Coding Shala

Home >> Java Programs >> Convert Binary to Decimal  Hey there, welcome back to another post. In this post, we will learn how to convert Binary to Decimal in Java. Java Program to Convert Binary to Decimal You have given a binary number, convert it to a decimal number. Example:  Input: 101 Output: 5 Input: 111 Output: 7 Binary to Decimal Conversion in Java Approach We will the below formula to convert binary to decimal: decimal number = (2^0) * (rightmost digit) + (2^1) * (second rightmost digit) + ...  for example:  binary number = 110 decimal number = 2^0 * 0 + 2^1 * 1 + 2^2 * 1 = 1 * 0 + 2 * 1 + 4 * 1 = 0 + 2 + 4 = 6 Java Program:  import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void printDecimal( int num) { int decimal = 0; int twos = 1; // 2^0 = 1 initial value while (num > 0) { ...
Read more

N-th Tribonacci Number Solution - The Coding Shala

Home >> Programming >> N-th Tribonacci Number  Hey there, welcome back to another post. In this post, we will learn how to solve the N-th Tribonacci Number problem and will implement its solution in Java. N-th Tribonacci Number Problem Statement The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. Given n, return the value of Tn.  Example 1:  Input: n = 4 Output: 4 Explanation: T_3 = 0 + 1 + 1 = 2 T_4 = 1 + 1 + 2 = 4 N-th Tribonacci Number Java Solution using Bottom-Up DP This problem is similar to the Fibonacci series. We can solve it using the Bottom-Up approach of dynamic programming. Time Complexity: O(n) Space Complexity: O(n) The space complexity can be reduced to O(1) by using variables to store the previous three values instead of using an array. Java Program:  class Solution { public int tribonacci( int n) { if (n == 0) return 0; ...
Read more

Shell Script to Create a Simple Calculator - The Coding Shala

Home >> Scripting >> simple calculator Shell Script to Create a Simple Calculator Write a shell script to create a simple calculator using a switch-case statement? Code:  #! / bin / bash echo "simple calculator" sum = 0 i = "y" echo "enter first number" read n1 echo "enter second number" read n2 while [ $ i = "y" ] do echo "1.Addition" echo "2.Subtraction" echo "3.Multiplication" echo "4.Division" echo "Enter choice" read ch case $ch in 1 ) sum =$(echo " $n1 + $n2" | bc - l) echo "Addition is =" $ sum ;; 2 ) sum =$(echo "$n1 - $n2" | bc - l) echo "Sub is =" $ sum ;; 3 ) sum =$(echo "$n1 * $n2" | bc - l) echo "Mul is =" $ sum ;; 4 ) sum =$(echo "$n1 / $n2" | bc - l) echo "div is =" $ sum ;; * )echo "invalid choice" esac echo "Do y...
Read more

LeetCode - Shuffle the Array Solution - The Coding Shala

Home >> LeetCode >> Shuffle the Array  In this post, we will learn how to solve LeetCode's Shuffle the Array problem and will implement its solution in Java. Shuffle the Array Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn]. Return the array in the form [x1,y1,x2,y2,...,xn,yn]. Example 1: Input: nums = [2,5,1,3,4,7], n = 3 Output: [2,3,5,4,1,7]  Explanation: Since x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 then the answer is [2,3,5,4,1,7]. Example 2: Input: nums = [1,2,3,4,4,3,2,1], n = 4 Output: [1,4,2,3,3,2,4,1] Practice this problem on LeetCode: Click Here. Shuffle the Array Java Solution Approach 1: Using a new Array. Space complexity: O(n). Java Program:  class Solution { public int [] shuffle ( int [] nums , int n ) { int [] ans = new int [ 2 * n ]; int j = 0 ; for ( int i = 0 ; i < 2 * n ; i = i + 2 ){ ans [ i ] = nums [ j ]; ans...
Read more

Java Program to Find GCD or HCF of Two Numbers - The Coding Shala

Home >> Java Programs >> Find GCD of Two Numbers  Hey there, welcome back to another post. In this post, we will learn how to find GCD or HCF of Two Numbers in Java. Java Program to Find GCD or HCF of Two Numbers The GCD (Greatest Common Divisor) or HCF (Highest Common Factor) of two numbers is the largest number that divides both of them. For example:  Number1: 6 (2 * 3) Number2: 9 (3 * 3) GCD or HCF of 6 and 9 is: 3 Find GCD of Two Numbers in Java using for Loop As we already know, GCD is the largest number that divides both numbers. We can start a for loop from 1 (because 1 divides all the numbers) to both numbers and if it divides both numbers then update GCD. Java Program:  import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void findGCD( int num1, int num2) { int gcd = 1; if (num1 == 0) { gcd = num2; } if (num2 == 0) { ...
Read more