Question

OYO | OA | SDE1 | Coding Questions and Solutions | 2022 | Set-1

Answer 1

#include<iostream>

#include<bits/stdc++.h>

using namespace std;

#define mod 1000000007;

int solve(int m,int n,int i,int j,int maxmove,vector<vector<int>>grid)

{  

    if(maxmove<0 )

    {

        return 0;

    }

    if(i<0 ||j<0 || i>=m ||j>=n)

    {

        return 1;

    }

 

    int up=solve(m,n,i-1,j,maxmove-1,grid)%mod;

    int down=solve(m,n,i+1,j,maxmove-1,grid)%mod;

    int left=solve(m,n,i,j-1,maxmove-1,grid)%mod;

    int right=solve(m,n,i,j+1,maxmove-1,grid)%mod;

 

    return (up+down+left+right)%mod;

}

int main()

{

    int m=2,n=2;

    int maxmove=2;

    int startRow=0,startCol=0;  

    vector<vector<int>>grid(m,vector<int>(n,1));

    //find ways to get out of this grid

   cout<< solve(m,n,startRow,startCol,maxmove,grid);  

}

Answer 2

Images of ques