Surrounded Regions

Here given code implementation process.

/*
   C Program for
   Surrounded Regions
*/
#include <stdio.h>
#define R 8 
#define C 7

// Print record elements
void printResult(char record[R][C])
{
    for (int i = 0; i < R; ++i)
    {
        for (int j = 0; j < C; ++j)
        {
            
            printf(" %c",record[i][j]);
            
        }
        printf("\n");
    }  
}
// Fill corner elements with a "O" value
void fill(char record[R][C],int i, int j)
{
   if(i < 0 || i >= R || j < 0 || j >= C)
   {
        return;
   }

   if(record[i][j] == '+')
   {
        // Update element
        record[i][j] = 'O';

        // visit to down element
        fill(record,i+1,j);
        // visit to up element
        fill(record,i-1,j);

        // visit to right element
        fill(record,i,j+1);
        // visit to left element
        fill(record,i,j-1);   
   }
}

// Fill surrounded regions
void solve(char record[R][C])
{
    // loop controlling variables
    int i = 0;
    int j = 0;
    printf("\n Before Surrounded \n");
    printResult(record);
    // First change the all zero with other symbol  "+"
    for ( i = 0; i < R; ++i)
    {
        for ( j = 0; j < C; ++j)
        {
            if(record[i][j]=='O')
            {
                record[i][j] = '+';
            }
        }
    } 
    // Change boundary 
    // Check first and last column
    for ( i = 0; i < R; ++i)
    {
        if(record[i][0] == '+')
        {
            fill(record,i,0);
        }

        if(record[i][C-1]=='+')
        {
            fill(record,i,C-1);
        }
    }

    // Check first and last row
    for ( i = 0; i < C; ++i)
    {
        if(record[0][i] == '+')
        {
            fill(record,0,i);
        }

        if(record[R-1][i]=='+')
        {
            fill(record,R-1,i);
        }
    }
    for ( i = 0; i < R; ++i)
    {
        for ( j = 0; j < C; ++j)
        {
            if(record[i][j]=='+')
            {
                record[i][j] = 'X';
            }
        }
    } 
    printf("\n After Surrounded \n");
    printResult(record);
}

int main()
{
    char record[R][C] =  
    {
        {'O', 'X', 'X', 'X', 'X', 'O', 'X'},
        {'X', 'X', 'X', 'X', 'O', 'X', 'O'},
        {'O', 'O', 'O', 'X', 'X', 'O', 'O'},
        {'X', 'O', 'X', 'X', 'X', 'X', 'X'},
        {'X', 'X', 'O', 'X', 'X', 'X', 'X'},
        {'X', 'O', 'X', 'X', 'X', 'X', 'X'},
        {'X', 'X', 'O', 'O', 'X', 'O', 'O'},
        {'X', 'X', 'O', 'X', 'O', 'X', 'O'},
    };
    /*
        Change all O with X when O is Surrounded by X
        Example
        ========
        // Left,Right, Bottom and Top are have X
            X   X
        X   O   O  X
            X   X
        
        Then change center O with X

            X   X
        X   X   X  X
            X   X
        -----------------------------
        or
            X
        X   O  X
            X   
        Then change center O with X
            X
        X   O  X
            X    
    */
    solve(record);

    return 0;
}

Output

 Before Surrounded
 O X X X X O X
 X X X X O X O
 O O O X X O O
 X O X X X X X
 X X O X X X X
 X O X X X X X
 X X O O X O O
 X X O X O X O

 After Surrounded
 O X X X X O X
 X X X X X X O
 O O O X X O O
 X O X X X X X
 X X X X X X X
 X X X X X X X
 X X O O X O O
 X X O X O X O

/*
   Java Program for
   surrounded regions
*/
public class Regions
{
    // Print record elements
    public void printresult(char[][] record, int r, int c)
    {
        for (int i = 0; i < r; ++i)
        {
            for (int j = 0; j < c; ++j)
            {
                System.out.print("  " + record[i][j]);
            }
            System.out.print("\n");
        }
    }
    // Fill corner elements with a "O" value
    public void fill(char[][] record, int i, int j, int r, int c)
    {
        if (i < 0 || i >= r || j < 0 || j >= c)
        {
            return;
        }
        if (record[i][j] == '+')
        {
            // Update element
            record[i][j] = 'O';
            // visit to down element
            fill(record, i + 1, j, r, c);
            // visit to up element
            fill(record, i - 1, j, r, c);
            // visit to right element
            fill(record, i, j + 1, r, c);
            // visit to left element
            fill(record, i, j - 1, r, c);
        }
    }
    // Fill surrounded regions
    public void solve(char[][] record)
    {
        // loop controlling variables
        int i = 0;
        int j = 0;
        int r = record.length;
        int c = record[0].length;
        System.out.print("\n Before Surrounded \n");
        printresult(record, r, c);
        // First change the all zero with other symbol  "+"
        for (i = 0; i < r; ++i)
        {
            for (j = 0; j < c; ++j)
            {
                if (record[i][j] == 'O')
                {
                    record[i][j] = '+';
                }
            }
        }
        // change boundary 
        // check first and last column
        for (i = 0; i < r; ++i)
        {
            if (record[i][0] == '+')
            {
                fill(record, i, 0, r, c);
            }
            if (record[i][c - 1] == '+')
            {
                fill(record, i, c - 1, r, c);
            }
        }
        // check first and last row
        for (i = 0; i < c; ++i)
        {
            if (record[0][i] == '+')
            {
                fill(record, 0, i, r, c);
            }
            if (record[r - 1][i] == '+')
            {
                fill(record, r - 1, i, r, c);
            }
        }
        for (i = 0; i < r; ++i)
        {
            for (j = 0; j < c; ++j)
            {
                if (record[i][j] == '+')
                {
                    record[i][j] = 'X';
                }
            }
        }
        System.out.print("\n After Surrounded \n");
        printresult(record, r, c);
    }
    public static void main(String[] args)
    {
        Regions task = new Regions();
        char [][]record =  
        {
            {'O', 'X', 'X', 'X', 'X', 'O', 'X'},
            {'X', 'X', 'X', 'X', 'O', 'X', 'O'},
            {'O', 'O', 'O', 'X', 'X', 'O', 'O'},
            {'X', 'O', 'X', 'X', 'X', 'X', 'X'},
            {'X', 'X', 'O', 'X', 'X', 'X', 'X'},
            {'X', 'O', 'X', 'X', 'X', 'X', 'X'},
            {'X', 'X', 'O', 'O', 'X', 'O', 'O'},
            {'X', 'X', 'O', 'X', 'O', 'X', 'O'},
        };
        /*
            Change all O with X when O is Surrounded by X
            Example
            ========
            // Left,right, Bottom and Top are have X
                X   X
            X   O   O  X
                X   X
            
            Then change center O with X

                X   X
            X   X   X  X
                X   X
            -----------------------------
            or
                X
            X   O  X
                X   
            Then change center O with X
                X
            X   O  X
                X    
        */
        task.solve(record);
    }
}

Output

 Before Surrounded
  O  X  X  X  X  O  X
  X  X  X  X  O  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  O  X  X  X  X
  X  O  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

 After Surrounded
  O  X  X  X  X  O  X
  X  X  X  X  X  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

// Include header file
#include <iostream>
#define R 8 
#define C 7
using namespace std;
/*
   C++ Program for
   surrounded regions
*/
class Regions
{
    public:
        // Print record elements
        void printresult(char record[R][C])
        {
            for (int i = 0; i < R; ++i)
            {
                for (int j = 0; j < C; ++j)
                {
                    cout << "  " << record[i][j];
                }
                cout << "\n";
            }
        }
    // Fill corner elements with a "O" value
    void fill(char record[R][C], int i, int j)
    {
        if (i < 0 || i >= R || j < 0 || j >= C)
        {
            return;
        }
        if (record[i][j] == '+')
        {
            // Update element
            record[i][j] = 'O';
            // visit to down element
            this->fill(record, i + 1, j);
            // visit to up element
            this->fill(record, i - 1, j);
            // visit to right element
            this->fill(record, i, j + 1);
            // visit to left element
            this->fill(record, i, j - 1);
        }
    }
    // Fill surrounded regions
    void solve(char record[R][C])
    {
        // loop controlling variables
        int i = 0;
        int j = 0;
  
        cout << "\n  Before Surrounded \n";
        this->printresult(record);
        // First change the all zero with other symbol  "+"
        for (i = 0; i < R; ++i)
        {
            for (j = 0; j < C; ++j)
            {
                if (record[i][j] == 'O')
                {
                    record[i][j] = '+';
                }
            }
        }
        // change boundary
        // check first and last column
        for (i = 0; i < R; ++i)
        {
            if (record[i][0] == '+')
            {
                this->fill(record, i, 0);
            }
            if (record[i][C - 1] == '+')
            {
                this->fill(record, i, C - 1);
            }
        }
        // check first and last row
        for (i = 0; i < C; ++i)
        {
            if (record[0][i] == '+')
            {
                this->fill(record, 0, i);
            }
            if (record[R - 1][i] == '+')
            {
                this->fill(record, R - 1, i);
            }
        }
        for (i = 0; i < R; ++i)
        {
            for (j = 0; j < C; ++j)
            {
                if (record[i][j] == '+')
                {
                    record[i][j] = 'X';
                }
            }
        }
        cout << "\n  After Surrounded \n";
        this->printresult(record);
    }
};
int main()
{
    Regions task = Regions();
    char record[R][C] =  
    {
        {'O', 'X', 'X', 'X', 'X', 'O', 'X'},
        {'X', 'X', 'X', 'X', 'O', 'X', 'O'},
        {'O', 'O', 'O', 'X', 'X', 'O', 'O'},
        {'X', 'O', 'X', 'X', 'X', 'X', 'X'},
        {'X', 'X', 'O', 'X', 'X', 'X', 'X'},
        {'X', 'O', 'X', 'X', 'X', 'X', 'X'},
        {'X', 'X', 'O', 'O', 'X', 'O', 'O'},
        {'X', 'X', 'O', 'X', 'O', 'X', 'O'},
    };
    /*
        Change all O with X when O is Surrounded by X
        Example
        ========
        // Left,right, Bottom and Top are have X
            X   X
        X   O   O  X
            X   X
        
        Then change center O with X
            X   X
        X   X   X  X
            X   X
        -----------------------------
        or
            X
        X   O  X
            X   
        Then change center O with X
            X
        X   O  X
            X    
    */
    task.solve(record);
    return 0;
}

Output

  Before Surrounded
  O  X  X  X  X  O  X
  X  X  X  X  O  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  O  X  X  X  X
  X  O  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

  After Surrounded
  O  X  X  X  X  O  X
  X  X  X  X  X  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

// Include namespace system
using System;
/*
   C# Program for
   surrounded regions
*/
public class Regions
{
    // Print record elements
    public void printresult(char[,] record, int r, int c)
    {
        for (int i = 0; i < r; ++i)
        {
            for (int j = 0; j < c; ++j)
            {
                Console.Write("  " + record[i,j]);
            }
            Console.Write("\n");
        }
    }
    // Fill corner elements with a "O" value
    public void fill(char[,] record, int i, int j, int r, int c)
    {
        if (i < 0 || i >= r || j < 0 || j >= c)
        {
            return;
        }
        if (record[i,j] == '+')
        {
            // Update element
            record[i,j] = 'O';
            // visit to down element
            fill(record, i + 1, j, r, c);
            // visit to up element
            fill(record, i - 1, j, r, c);
            // visit to right element
            fill(record, i, j + 1, r, c);
            // visit to left element
            fill(record, i, j - 1, r, c);
        }
    }
    // Fill surrounded regions
    public void solve(char[,] record)
    {
        // loop controlling variables
        int i = 0;
        int j = 0;
        int r = record.GetLength(0);
        int c = record.GetLength(1);
        Console.Write("\n  Before Surrounded \n");
        printresult(record, r, c);
        // First change the all zero with other symbol  "+"
        for (i = 0; i < r; ++i)
        {
            for (j = 0; j < c; ++j)
            {
                if (record[i,j] == 'O')
                {
                    record[i,j] = '+';
                }
            }
        }
        // change boundary
        // check first and last column
        for (i = 0; i < r; ++i)
        {
            if (record[i,0] == '+')
            {
                fill(record, i, 0, r, c);
            }
            if (record[i,c - 1] == '+')
            {
                fill(record, i, c - 1, r, c);
            }
        }
        // check first and last row
        for (i = 0; i < c; ++i)
        {
            if (record[0,i] == '+')
            {
                fill(record, 0, i, r, c);
            }
            if (record[r - 1,i] == '+')
            {
                fill(record, r - 1, i, r, c);
            }
        }
        for (i = 0; i < r; ++i)
        {
            for (j = 0; j < c; ++j)
            {
                if (record[i,j] == '+')
                {
                    record[i,j] = 'X';
                }
            }
        }
        Console.Write("\n  After Surrounded \n");
        printresult(record, r, c);
    }
    public static void Main(String[] args)
    {
        Regions task = new Regions();
        char[,] record = 
        {
            {'O', 'X', 'X', 'X', 'X', 'O', 'X'},
            {'X', 'X', 'X', 'X', 'O', 'X', 'O'},
            {'O', 'O', 'O', 'X', 'X', 'O', 'O'},
            {'X', 'O', 'X', 'X', 'X', 'X', 'X'},
            {'X', 'X', 'O', 'X', 'X', 'X', 'X'},
            {'X', 'O', 'X', 'X', 'X', 'X', 'X'},
            {'X', 'X', 'O', 'O', 'X', 'O', 'O'},
            {'X', 'X', 'O', 'X', 'O', 'X', 'O'}
        };
        /*
            Change all O with X when O is Surrounded by X
            Example
            ========
            // Left,right, Bottom and Top are have X
                X   X
            X   O   O  X
                X   X
            
            Then change center O with X
                X   X
            X   X   X  X
                X   X
            -----------------------------
            or
                X
            X   O  X
                X   
            Then change center O with X
                X
            X   O  X
                X    
        */
        task.solve(record);
    }
}

Output

  Before Surrounded
  O  X  X  X  X  O  X
  X  X  X  X  O  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  O  X  X  X  X
  X  O  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

  After Surrounded
  O  X  X  X  X  O  X
  X  X  X  X  X  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

<?php
/*
   Php Program for
   surrounded regions
*/
class Regions
{
    // Print record elements
    public  function printresult( & $record, $r, $c)
    {
        for ($i = 0; $i < $r; ++$i)
        {
            for ($j = 0; $j < $c; ++$j)
            {
                echo "  ". $record[$i][$j];
            }
            echo "\n";
        }
    }
    // Fill corner elements with a "O" value
    public  function fill( & $record, $i, $j, $r, $c)
    {
        if ($i < 0 || $i >= $r || $j < 0 || $j >= $c)
        {
            return;
        }
        if ($record[$i][$j] == '+')
        {
            // Update element
            $record[$i][$j] = 'O';
            // visit to down element
            $this->fill($record, $i + 1, $j, $r, $c);
            // visit to up element
            $this->fill($record, $i - 1, $j, $r, $c);
            // visit to right element
            $this->fill($record, $i, $j + 1, $r, $c);
            // visit to left element
            $this->fill($record, $i, $j - 1, $r, $c);
        }
    }
    // Fill surrounded regions
    public  function solve( & $record)
    {
        // loop controlling variables
        $i = 0;
        $j = 0;
        $r = count($record);
        $c = count($record[0]);
        echo "\n  Before Surrounded \n";
        $this->printresult($record, $r, $c);
        // First change the all zero with other symbol  "+"
        for ($i = 0; $i < $r; ++$i)
        {
            for ($j = 0; $j < $c; ++$j)
            {
                if ($record[$i][$j] == 'O')
                {
                    $record[$i][$j] = '+';
                }
            }
        }
        // change boundary
        // check first and last column
        for ($i = 0; $i < $r; ++$i)
        {
            if ($record[$i][0] == '+')
            {
                $this->fill($record, $i, 0, $r, $c);
            }
            if ($record[$i][$c - 1] == '+')
            {
                $this->fill($record, $i, $c - 1, $r, $c);
            }
        }
        // check first and last row
        for ($i = 0; $i < $c; ++$i)
        {
            if ($record[0][$i] == '+')
            {
                $this->fill($record, 0, $i, $r, $c);
            }
            if ($record[$r - 1][$i] == '+')
            {
                $this->fill($record, $r - 1, $i, $r, $c);
            }
        }
        for ($i = 0; $i < $r; ++$i)
        {
            for ($j = 0; $j < $c; ++$j)
            {
                if ($record[$i][$j] == '+')
                {
                    $record[$i][$j] = 'X';
                }
            }
        }
        echo "\n  After Surrounded \n";
        $this->printresult($record, $r, $c);
    }
}

function main()
{
    $task = new Regions();
    $record = array(
      array('O', 'X', 'X', 'X', 'X', 'O', 'X'), 
      array('X', 'X', 'X', 'X', 'O', 'X', 'O'), 
      array('O', 'O', 'O', 'X', 'X', 'O', 'O'), 
      array('X', 'O', 'X', 'X', 'X', 'X', 'X'), 
      array('X', 'X', 'O', 'X', 'X', 'X', 'X'), 
      array('X', 'O', 'X', 'X', 'X', 'X', 'X'), 
      array('X', 'X', 'O', 'O', 'X', 'O', 'O'), 
      array('X', 'X', 'O', 'X', 'O', 'X', 'O')
    );
    /*
        Change all O with X when O is Surrounded by X
        Example
        ========
        // Left,right, Bottom and Top are have X
            X   X
        X   O   O  X
            X   X
        
        Then change center O with X
            X   X
        X   X   X  X
            X   X
        -----------------------------
        or
            X
        X   O  X
            X   
        Then change center O with X
            X
        X   O  X
            X    
    */
    $task->solve($record);
}
main();

Output

  Before Surrounded
  O  X  X  X  X  O  X
  X  X  X  X  O  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  O  X  X  X  X
  X  O  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

  After Surrounded
  O  X  X  X  X  O  X
  X  X  X  X  X  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

/*
   Node Js Program for
   surrounded regions
*/
class Regions
{
    // Print record elements
    printresult(record, r, c)
    {
        for (var i = 0; i < r; ++i)
        {
            for (var j = 0; j < c; ++j)
            {
                process.stdout.write("  " + record[i][j]);
            }
            process.stdout.write("\n");
        }
    }
    // Fill corner elements with a "O" value
    fill(record, i, j, r, c)
    {
        if (i < 0 || i >= r || j < 0 || j >= c)
        {
            return;
        }
        if (record[i][j] == '+')
        {
            // Update element
            record[i][j] = 'O';
            // visit to down element
            this.fill(record, i + 1, j, r, c);
            // visit to up element
            this.fill(record, i - 1, j, r, c);
            // visit to right element
            this.fill(record, i, j + 1, r, c);
            // visit to left element
            this.fill(record, i, j - 1, r, c);
        }
    }
    // Fill surrounded regions
    solve(record)
    {
        // loop controlling variables
        var i = 0;
        var j = 0;
        var r = record.length;
        var c = record[0].length;
        process.stdout.write("\n  Before Surrounded \n");
        this.printresult(record, r, c);
        // First change the all zero with other symbol  "+"
        for (i = 0; i < r; ++i)
        {
            for (j = 0; j < c; ++j)
            {
                if (record[i][j] == 'O')
                {
                    record[i][j] = '+';
                }
            }
        }
        // change boundary
        // check first and last column
        for (i = 0; i < r; ++i)
        {
            if (record[i][0] == '+')
            {
                this.fill(record, i, 0, r, c);
            }
            if (record[i][c - 1] == '+')
            {
                this.fill(record, i, c - 1, r, c);
            }
        }
        // check first and last row
        for (i = 0; i < c; ++i)
        {
            if (record[0][i] == '+')
            {
                this.fill(record, 0, i, r, c);
            }
            if (record[r - 1][i] == '+')
            {
                this.fill(record, r - 1, i, r, c);
            }
        }
        for (i = 0; i < r; ++i)
        {
            for (j = 0; j < c; ++j)
            {
                if (record[i][j] == '+')
                {
                    record[i][j] = 'X';
                }
            }
        }
        process.stdout.write("\n  After Surrounded \n");
        this.printresult(record, r, c);
    }
}

function main()
{
    var task = new Regions();
    var record = [
      ['O', 'X', 'X', 'X', 'X', 'O', 'X'] , 
      ['X', 'X', 'X', 'X', 'O', 'X', 'O'] , 
      ['O', 'O', 'O', 'X', 'X', 'O', 'O'] , 
      ['X', 'O', 'X', 'X', 'X', 'X', 'X'] , 
      ['X', 'X', 'O', 'X', 'X', 'X', 'X'] , 
      ['X', 'O', 'X', 'X', 'X', 'X', 'X'] , 
      ['X', 'X', 'O', 'O', 'X', 'O', 'O'] , 
      ['X', 'X', 'O', 'X', 'O', 'X', 'O']
    ];
    /*
        Change all O with X when O is Surrounded by X
        Example
        ========
        // Left,right, Bottom and Top are have X
            X   X
        X   O   O  X
            X   X
        
        Then change center O with X
            X   X
        X   X   X  X
            X   X
        -----------------------------
        or
            X
        X   O  X
            X   
        Then change center O with X
            X
        X   O  X
            X    
    */
    task.solve(record);
}
main();

Output

  Before Surrounded
  O  X  X  X  X  O  X
  X  X  X  X  O  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  O  X  X  X  X
  X  O  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

  After Surrounded
  O  X  X  X  X  O  X
  X  X  X  X  X  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

#    Python 3 Program for
#    surrounded regions

class Regions :
    #  Print record elements
    def printresult(self, record, r, c) :
        i = 0
        j = 0
        while (i < r) :
            while (j < c) :
                print("  ", record[i][j], end = "")
                j += 1
            
            print(end = "\n")
            i += 1
            j = 0
        
    
    #  Fill corner elements with a "O" value
    def fill(self, record, i, j, r, c) :
        if (i < 0 or i >= r or j < 0 or j >= c) :
            return
        
        if (record[i][j] == '+') :
            #  Update element
            record[i][j] = 'O'
            #  visit to down element
            self.fill(record, i + 1, j, r, c)
            #  visit to up element
            self.fill(record, i - 1, j, r, c)
            #  visit to right element
            self.fill(record, i, j + 1, r, c)
            #  visit to left element
            self.fill(record, i, j - 1, r, c)
        
    
    #  Fill surrounded regions
    def solve(self, record) :
        #  loop controlling variables
        i = 0
        j = 0
        r = len(record)
        c = len(record[0])
        print("\n  Before Surrounded ")
        self.printresult(record, r, c)
        #  First change the all zero with other symbol  "+"
        while (i < r) :
            while (j < c) :
                if (record[i][j] == 'O') :
                    record[i][j] = '+'
                
                j += 1
            
            i += 1
            j = 0
        
        #  change boundary
        #  check first and last column
        i = 0
        while (i < r) :
            if (record[i][0] == '+') :
                self.fill(record, i, 0, r, c)
            
            if (record[i][c - 1] == '+') :
                self.fill(record, i, c - 1, r, c)
            
            i += 1
        
        #  check first and last row
        i = 0
        while (i < c) :
            if (record[0][i] == '+') :
                self.fill(record, 0, i, r, c)
            
            if (record[r - 1][i] == '+') :
                self.fill(record, r - 1, i, r, c)
            
            i += 1
        
        i = 0
        while (i < r) :
            j = 0
            while (j < c) :
                if (record[i][j] == '+') :
                    record[i][j] = 'X'
                
                j += 1
            
            i += 1
        
        print("\n  After Surrounded ")
        self.printresult(record, r, c)
    

def main() :
    task = Regions()
    record = [
      ['O', 'X', 'X', 'X', 'X', 'O', 'X'] , 
      ['X', 'X', 'X', 'X', 'O', 'X', 'O'] , 
      ['O', 'O', 'O', 'X', 'X', 'O', 'O'] , 
      ['X', 'O', 'X', 'X', 'X', 'X', 'X'] , 
      ['X', 'X', 'O', 'X', 'X', 'X', 'X'] , 
      ['X', 'O', 'X', 'X', 'X', 'X', 'X'] , 
      ['X', 'X', 'O', 'O', 'X', 'O', 'O'] , 
      ['X', 'X', 'O', 'X', 'O', 'X', 'O']
    ]
    # 
    #     Change all O with X when O is Surrounded by X
    #     Example
    #     ========
    #     // Left,right, Bottom and Top are have X
    #         X   X
    #     X   O   O  X
    #         X   X
    #     
    #     Then change center O with X
    #         X   X
    #     X   X   X  X
    #         X   X
    #     -----------------------------
    #     or
    #         X
    #     X   O  X
    #         X   
    #     Then change center O with X
    #         X
    #     X   O  X
    #         X    
    
    task.solve(record)

if __name__ == "__main__": main()

Output

  Before Surrounded
   O   X   X   X   X   O   X
   X   X   X   X   O   X   O
   O   O   O   X   X   O   O
   X   O   X   X   X   X   X
   X   X   O   X   X   X   X
   X   O   X   X   X   X   X
   X   X   O   O   X   O   O
   X   X   O   X   O   X   O

  After Surrounded
   O   X   X   X   X   O   X
   X   X   X   X   X   X   O
   O   O   O   X   X   O   O
   X   O   X   X   X   X   X
   X   X   X   X   X   X   X
   X   X   X   X   X   X   X
   X   X   O   O   X   O   O
   X   X   O   X   O   X   O

#    Ruby Program for
#    surrounded regions

class Regions 
    #  Print record elements
    def printresult(record, r, c) 
        i = 0
        j = 0
        while (i < r) 
            while (j < c) 
                print("  ", record[i][j])
                j += 1
            end

            print("\n")
            i += 1
            j = 0
        end

    end

    #  Fill corner elements with a "O" value
    def fill(record, i, j, r, c) 
        if (i < 0 || i >= r || j < 0 || j >= c) 
            return
        end

        if (record[i][j] == '+') 
            #  Update element
            record[i][j] = 'O'
            #  visit to down element
            self.fill(record, i + 1, j, r, c)
            #  visit to up element
            self.fill(record, i - 1, j, r, c)
            #  visit to right element
            self.fill(record, i, j + 1, r, c)
            #  visit to left element
            self.fill(record, i, j - 1, r, c)
        end

    end

    #  Fill surrounded regions
    def solve(record) 
        #  loop controlling variables
        i = 0
        j = 0
        r = record.length
        c = record[0].length
        print("\n  Before Surrounded \n")
        self.printresult(record, r, c)
        #  First change the all zero with other symbol  "+"
        while (i < r) 
            while (j < c) 
                if (record[i][j] == 'O') 
                    record[i][j] = '+'
                end

                j += 1
            end

            i += 1
            j = 0
        end

        #  change boundary
        #  check first and last column
        i = 0
        while (i < r) 
            if (record[i][0] == '+') 
                self.fill(record, i, 0, r, c)
            end

            if (record[i][c - 1] == '+') 
                self.fill(record, i, c - 1, r, c)
            end

            i += 1
        end

        #  check first and last row
        i = 0
        while (i < c) 
            if (record[0][i] == '+') 
                self.fill(record, 0, i, r, c)
            end

            if (record[r - 1][i] == '+') 
                self.fill(record, r - 1, i, r, c)
            end

            i += 1
        end

        i = 0
        while (i < r) 
            j = 0
            while (j < c) 
                if (record[i][j] == '+') 
                    record[i][j] = 'X'
                end

                j += 1
            end

            i += 1
        end

        print("\n  After Surrounded \n")
        self.printresult(record, r, c)
    end

end

def main() 
    task = Regions.new()
    record = [
      ['O', 'X', 'X', 'X', 'X', 'O', 'X'] , 
      ['X', 'X', 'X', 'X', 'O', 'X', 'O'] , 
      ['O', 'O', 'O', 'X', 'X', 'O', 'O'] , 
      ['X', 'O', 'X', 'X', 'X', 'X', 'X'] , 
      ['X', 'X', 'O', 'X', 'X', 'X', 'X'] , 
      ['X', 'O', 'X', 'X', 'X', 'X', 'X'] , 
      ['X', 'X', 'O', 'O', 'X', 'O', 'O'] , 
      ['X', 'X', 'O', 'X', 'O', 'X', 'O']
    ]
    # 
    #     Change all O with X when O is Surrounded by X
    #     Example
    #     ========
    #     // Left,right, Bottom and Top are have X
    #         X   X
    #     X   O   O  X
    #         X   X
    #     
    #     Then change center O with X
    #         X   X
    #     X   X   X  X
    #         X   X
    #     -----------------------------
    #     or
    #         X
    #     X   O  X
    #         X   
    #     Then change center O with X
    #         X
    #     X   O  X
    #         X    
    
    task.solve(record)
end

main()

Output

  Before Surrounded 
  O  X  X  X  X  O  X
  X  X  X  X  O  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  O  X  X  X  X
  X  O  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

  After Surrounded 
  O  X  X  X  X  O  X
  X  X  X  X  X  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

/*
   Scala Program for
   surrounded regions
*/
class Regions
{
    // Print record elements
    def printresult(record: Array[Array[Character]], r: Int, c: Int): Unit = {
        var i: Int = 0;
        var j: Int = 0;
        while (i < r)
        {
            while (j < c)
            {
                print("  " + record(i)(j));
                j += 1;
            }
            print("\n");
            i += 1;
            j = 0;
        }
    }
    // Fill corner elements with a "O" value
    def fill(record: Array[Array[Character]], i: Int, j: Int, r: Int, c: Int): Unit = {
        if (i < 0 || i >= r || j < 0 || j >= c)
        {
            return;
        }
        if (record(i)(j) == '+')
        {
            // Update element
            record(i)(j) = 'O';
            // visit to down element
            this.fill(record, i + 1, j, r, c);
            // visit to up element
            this.fill(record, i - 1, j, r, c);
            // visit to right element
            this.fill(record, i, j + 1, r, c);
            // visit to left element
            this.fill(record, i, j - 1, r, c);
        }
    }
    // Fill surrounded regions
    def solve(record: Array[Array[Character]]): Unit = {
        // loop controlling variables
        var i: Int = 0;
        var j: Int = 0;
        var r: Int = record.length;
        var c: Int = record(0).length;
        print("\n  Before Surrounded \n");
        this.printresult(record, r, c);
        // First change the all zero with other symbol  "+"
        while (i < r)
        {
            while (j < c)
            {
                if (record(i)(j) == 'O')
                {
                    record(i)(j) = '+';
                }
                j += 1;
            }
            i += 1;
            j = 0;
        }
        // change boundary
        // check first and last column
        i = 0;
        while (i < r)
        {
            if (record(i)(0) == '+')
            {
                this.fill(record, i, 0, r, c);
            }
            if (record(i)(c - 1) == '+')
            {
                this.fill(record, i, c - 1, r, c);
            }
            i += 1;
        }
        // check first and last row
        i = 0;
        while (i < c)
        {
            if (record(0)(i) == '+')
            {
                this.fill(record, 0, i, r, c);
            }
            if (record(r - 1)(i) == '+')
            {
                this.fill(record, r - 1, i, r, c);
            }
            i += 1;
        }
        i = 0;
        while (i < r)
        {
            j = 0;
            while (j < c)
            {
                if (record(i)(j) == '+')
                {
                    record(i)(j) = 'X';
                }
                j += 1;
            }
            i += 1;
        }
        print("\n  After Surrounded \n");
        this.printresult(record, r, c);
    }
}
object Main
{
    def main(args: Array[String]): Unit = {
        var task: Regions = new Regions();
        var record: Array[Array[Character]] = Array(
          Array('O', 'X', 'X', 'X', 'X', 'O', 'X'), 
          Array('X', 'X', 'X', 'X', 'O', 'X', 'O'), 
          Array('O', 'O', 'O', 'X', 'X', 'O', 'O'), 
          Array('X', 'O', 'X', 'X', 'X', 'X', 'X'), 
          Array('X', 'X', 'O', 'X', 'X', 'X', 'X'), 
          Array('X', 'O', 'X', 'x', 'X', 'X', 'X'), 
          Array('X', 'X', 'O', 'O', 'X', 'O', 'O'), 
          Array('X', 'X', 'O', 'X', 'O', 'X', 'O')
        );
        /*
            Change all O with X when O is Surrounded by X
            Example
            ========
            // Left,right, Bottom and Top are have X
                X   X
            X   O   O  X
                X   X
            
            Then change center O with X
                X   X
            X   X   X  X
                X   X
            -----------------------------
            or
                X
            X   O  X
                X   
            Then change center O with X
                X
            X   O  X
                X    
        */
        task.solve(record);
    }
}

Output

  Before Surrounded
  O  X  X  X  X  O  X
  X  X  X  X  O  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  O  X  X  X  X
  X  O  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

  After Surrounded
  O  X  X  X  X  O  X
  X  X  X  X  X  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

/*
   Swift 4 Program for
   surrounded regions
*/
class Regions
{
    // Print record elements
    func printresult(_ record: [
        [Character]
    ], _ r: Int, _ c: Int)
    {
        var i: Int = 0;
        var j: Int = 0;
        while (i < r)
        {
            while (j < c)
            {
                print("  ", record[i][j], terminator: "");
                j += 1;
            }
            print(terminator: "\n");
            i += 1;
            j = 0;
        }
    }
    // Fill corner elements with a "O" value
    func fill(_ record: inout[[Character]], _ i: Int, _ j: Int, _ r: Int, _ c: Int)
    {
        if (i < 0 || i >= r || j < 0 || j >= c)
        {
            return;
        }
        if (record[i][j] == "+")
        {
            // Update element
            record[i][j] = "O";
            // visit to down element
            self.fill(&record, i + 1, j, r, c);
            // visit to up element
            self.fill(&record, i - 1, j, r, c);
            // visit to right element
            self.fill(&record, i, j + 1, r, c);
            // visit to left element
            self.fill(&record, i, j - 1, r, c);
        }
    }
    // Fill surrounded regions
    func solve(_ record: inout[[Character]])
    {
        // loop controlling variables
        var i: Int = 0;
        var j: Int = 0;
        let r: Int = record.count;
        let c: Int = record[0].count;
        print("\n  Before Surrounded ");
        self.printresult(record, r, c);
        // First change the all zero with other symbol  "+"
        while (i < r)
        {
            while (j < c)
            {
                if (record[i][j] == "O")
                {
                    record[i][j] = "+";
                }
                j += 1;
            }
            i += 1;
            j = 0;
        }
        // change boundary
        // check first and last column
        i = 0;
        while (i < r)
        {
            if (record[i][0] == "+")
            {
                self.fill(&record, i, 0, r, c);
            }
            if (record[i][c - 1] == "+")
            {
                self.fill(&record, i, c - 1, r, c);
            }
            i += 1;
        }
        // check first and last row
        i = 0;
        while (i < c)
        {
            if (record[0][i] == "+")
            {
                self.fill(&record, 0, i, r, c);
            }
            if (record[r - 1][i] == "+")
            {
                self.fill(&record, r - 1, i, r, c);
            }
            i += 1;
        }
        i = 0;
        while (i < r)
        {
            j = 0;
            while (j < c)
            {
                if (record[i][j] == "+")
                {
                    record[i][j] = "X";
                }
                j += 1;
            }
            i += 1;
        }
        print("\n  After Surrounded ");
        self.printresult(record, r, c);
    }
}
func main()
{
    let task: Regions = Regions();
    var record: [[Character]] = [
      ["O", "X", "X", "X", "X", "O", "X"] , 
      ["X", "X", "X", "X", "O", "X", "O"] , 
      ["O", "O", "O", "X", "X", "O", "O"] , 
      ["X", "O", "X", "X", "X", "X", "X"] , 
      ["X", "X", "O", "X", "X", "X", "X"] , 
      ["X", "O", "X", "X", "X", "X", "X"] , 
      ["X", "X", "O", "O", "X", "O", "O"] , 
      ["X", "X", "O", "X", "O", "X", "O"]
    ];
    /*
        Change all O with X when O is Surrounded by X
        Example
        ========
        // Left,right, Bottom and Top are have X
            X   X
        X   O   O  X
            X   X
        
        Then change center O with X
            X   X
        X   X   X  X
            X   X
        -----------------------------
        or
            X
        X   O  X
            X   
        Then change center O with X
            X
        X   O  X
            X    
    */
    task.solve(&record);
}
main();

Output

  Before Surrounded
   O   X   X   X   X   O   X
   X   X   X   X   O   X   O
   O   O   O   X   X   O   O
   X   O   X   X   X   X   X
   X   X   O   X   X   X   X
   X   O   X   X   X   X   X
   X   X   O   O   X   O   O
   X   X   O   X   O   X   O

  After Surrounded
   O   X   X   X   X   O   X
   X   X   X   X   X   X   O
   O   O   O   X   X   O   O
   X   O   X   X   X   X   X
   X   X   X   X   X   X   X
   X   X   X   X   X   X   X
   X   X   O   O   X   O   O
   X   X   O   X   O   X   O

/*
   Kotlin Program for
   surrounded regions
*/
class Regions
{
    // Print record elements
    fun printresult(record: Array <Array<Char>> , r: Int, c: Int): Unit
    {
        var i: Int = 0;
        var j: Int = 0;
        while (i < r)
        {
            while (j < c)
            {
                print("  " + record[i][j]);
                j += 1;
            }
            print("\n");
            i += 1;
            j = 0;
        }
    }
    // Fill corner elements with a "O" value
    fun fill(record: Array <Array<Char>> , i: Int, j: Int, r: Int, c: Int): Unit
    {
        if (i < 0 || i >= r || j < 0 || j >= c)
        {
            return;
        }
        if (record[i][j] == '+')
        {
            // Update element
            record[i][j] = 'O';
            // visit to down element
            this.fill(record, i + 1, j, r, c);
            // visit to up element
            this.fill(record, i - 1, j, r, c);
            // visit to right element
            this.fill(record, i, j + 1, r, c);
            // visit to left element
            this.fill(record, i, j - 1, r, c);
        }
    }
    // Fill surrounded regions
    fun solve(record: Array < Array < Char >> ): Unit
    {
        // loop controlling variables
        var i: Int = 0;
        var j: Int = 0;
        var r: Int = record.count();
        var c: Int = record[0].count();
        print("\n  Before Surrounded \n");
        this.printresult(record, r, c);
        // First change the all zero with other symbol  "+"
        while (i < r)
        {
            while (j < c)
            {
                if (record[i][j] == 'O')
                {
                    record[i][j] = '+';
                }
                j += 1;
            }
            i += 1;
            j = 0;
        }
        // change boundary
        // check first and last column
        i = 0;
        while (i < r)
        {
            if (record[i][0] == '+')
            {
                this.fill(record, i, 0, r, c);
            }
            if (record[i][c - 1] == '+')
            {
                this.fill(record, i, c - 1, r, c);
            }
            i += 1;
        }
        // check first and last row
        i = 0;
        while (i < c)
        {
            if (record[0][i] == '+')
            {
                this.fill(record, 0, i, r, c);
            }
            if (record[r - 1][i] == '+')
            {
                this.fill(record, r - 1, i, r, c);
            }
            i += 1;
        }
        i = 0;
        while (i < r)
        {
            j = 0;
            while (j < c)
            {
                if (record[i][j] == '+')
                {
                    record[i][j] = 'X';
                }
                j += 1;
            }
            i += 1;
        }
        print("\n  After Surrounded \n");
        this.printresult(record, r, c);
    }
}
fun main(args: Array <String> ): Unit
{
    var task: Regions = Regions();
    var record: Array<Array<Char>> = arrayOf(
      arrayOf('O', 'X', 'X', 'X', 'X', 'O', 'X'), 
      arrayOf('X', 'X', 'X', 'X', 'O', 'X', 'O'), 
      arrayOf('O', 'O', 'O', 'X', 'X', 'O', 'O'), 
      arrayOf('X', 'O', 'X', 'X', 'X', 'X', 'X'), 
      arrayOf('X', 'X', 'O', 'X', 'X', 'X', 'X'), 
      arrayOf('X', 'O', 'X', 'X', 'X', 'X', 'X'), 
      arrayOf('X', 'X', 'O', 'O', 'X', 'O', 'O'), 
      arrayOf('X', 'X', 'O', 'X', 'O', 'X', 'O')
    );
    /*
        Change all O with X when O is Surrounded by X
        Example
        ========
        // Left,right, Bottom and Top are have X
            X   X
        X   O   O  X
            X   X
        
        Then change center O with X
            X   X
        X   X   X  X
            X   X
        -----------------------------
        or
            X
        X   O  X
            X   
        Then change center O with X
            X
        X   O  X
            X    
    */
    task.solve(record);
}

Output

  Before Surrounded
  O  X  X  X  X  O  X
  X  X  X  X  O  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  O  X  X  X  X
  X  O  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

  After Surrounded
  O  X  X  X  X  O  X
  X  X  X  X  X  X  O
  O  O  O  X  X  O  O
  X  O  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  X  X  X  X  X
  X  X  O  O  X  O  O
  X  X  O  X  O  X  O

« Previous Next »

Backtracking

Print all permutations of a string

Print all combinations of balanced parentheses

Print all solutions in N-Queen Problem

Distinct permutations of the string

Warnsdorff’s algorithm for knight’s tour problem

Rat in a Maze

Find all solutions in a maze

Print all Hamiltonian path present in a graph

Print all intervals of given number

Find longest path in maze

Find longest increasing path in a matrix

Subset sum using backtracking

Find max number using k swap

Locate the center path of given maze by using footprint

Permutation with spaces

Tug of War

K partition with equal sum

Longest common subsequence

Print all longest common subsequence

Find all subsets using backtracking

Surrounded Regions

Generate n bit gray code

Find permutation of numbers divisible by k

Find maximum size subset with given sum

Split a number into smaller numbers

Find all subsequences with given sum and length

Find all perfect square root of n digit

Find all possible path with one magical key in maze

Print all permutations with repetition of characters

Print all initials sequences of given length

Print k size combinations in given array

Split a numeric string into fibonacci sequence

Print all N digit strictly increasing numbers

Print all possible strings of length N in a set

Knight Tour Problem

Generate all the binary strings of N bits

Print all binary strings without consecutive 1s

Generate all binary strings from given pattern

Print all palindrome permutations of a string

Possible ways to break a string using brackets

Print all interleavings of two strings

Longest possible route in a matrix with hurdles

Find all distinct combinations of k sum in array

Find paths from corner cell to middle cell in maze

Fill two instances of all numbers from 1 to n in a specific interval

Split a string into maximum number of unique substrings

Generate minimum number of coins that make a given value

Letter case permutation by using backtracking

Find all subsequences of string which divisible by k

Find possible group which contains one and two consecutive elements

Display Friends Pairing Group

Display all possible permutations of a number divisible by K

Power set in lexicographic order

Print all possible combinations of given size

Print all subsets with given sum

Print all possible combinations of given sum from 1 to n

Print distinct combinations of given sum without repeating number

Print all subsequences of given size

Print all sequences from 1 to n in given length k

Increasing subsequence of n natural number in k size

Print all non-increasing sequence of sum equal to a given number k

Print all combinations of N length sequences whose product is M

Distinct combinations of N length sequences whose product is M

Sequences of length K having each term divisible by its preceding term

Find all subsequences whose product is less than k in array

Find all subsequences of N length whose sum is even

Print all combinations of n natural number whose pair element difference is one

Find all even length binary sequences with same sum of first and second half bits

Print all subsequences of x whose sum is combination of even numbers

Generate palindromic binary strings of given length N

Generate all palindromic subsequence of n natural number

Generate all palindromic subsequence of length N and K Odd natural number

Generate all palindromic subsequence of length N and K Even natural number

Generate all palindromic subsequence of n natural number Whose adjacent elements are different type

Find Subset sum which divisible by k

Generate fixed bitonic sequence of n natural number

Generate all bitonic sequence of given range and size

Find all four elements that sum to a given value

Print all combinations factors of given number

Print combinations of characters of a numeric string which is less than x

Print all combinations of other digits on a '$' place of given sequence

All combinations of strings that can be used to dial a number

Travelling salesman problem using backtracking

Generate combinations of integer product whose adjacent numbers are not similar

Generate all unique partitions of a number

Generate all k digit number whose sum is to x

Generate all distinct combinations of N numbers whose sum is X

Generate combination of two equal length string which is belong to index

Generate all the products of a number in which each element is divisible by the previous element

Print all the sequences of length m that begin with n and the consecutive difference is less than k

Print the combinations of given vertices which connect of M edges they not contain cycle and its path cost is positive by node

Generate all passwords from given character set

Generate permutations with only adjacent swaps allowed

Generate all prime partition of a number

Split a number into prime numbers

Split a large Even number into small Even number

Split a large Odd number into small Odd number

Print all N digit jumping numbers

Print all n-digit numbers with sum of even and odd position digits whose absolute difference are one

Generate all possible permutations of words in a String

Generate all binary strings with 1 and 0 of size N

Print all distinct combinations of sum x and n natural number

Generate all n digit numbers whose consecutive even and odd digit

Generate all n digit numbers whose consecutive odd and even digit

Comment

Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.

New Comment

Name