Problem of The Day: 21/02/2023 | Fill the Matrix | Siddharth Hazra

Welcome to our daily problem solving session where Siddharth will be tackling the Problem of The Day. We will be discussing the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up your concepts of Data Structures and Algorithms, but will also help you build up problem solving skills.

So come along and solve the POD of 21st Feb 2023 with us!



Daily solutions will be streamed live exclusively on our channel! So start solving today and subscribe to our channel for the free coding lessons.

-----------------------------------------------------------------------------------------



-----------------------------------------------------------------------------------------

Follow us and stay updated on everything happening in the world of geeks:


#GFGPractice #GeeksforGeeks #ProblemofTheDay #CodingQuestions #POTD

[LearnIng-xofi]

class Solution{
public:
int minIteration(int n, int m, int x, int y){
// code here
int i, j, res=0, vst_cnt=1, ele=n*m;
bool b1, b2, b3, b4;
vector<vector<int>>v(n, vector<int>(m, 0));
v[x-1][y-1]=1;
queue<pair<int, int>>q;
q.push({x-1, y-1});
pair<int, int>p;
while(!q.empty())
{
p=q.front();
q.pop();
i=p.first;
j=p.second;
b1=b2=b3=b4=0;
if(i-1>-1 && v[i-1][j]==0)
{
v[i-1][j]=1;
vst_cnt++;
b1=1;
q.push({i-1, j});
}
if(i+1<n && v[i+1][j]==0)
{

v[i+1][j]=1;
vst_cnt++;
b2=1;
q.push({i+1, j});
}
if(j-1>-1 && v[i][j-1]==0)
{
v[i][j-1]==1;
vst_cnt++;
b3=1;
q.push({i, j-1});
}
if(j+1<m && v[i][j+1]==0)
{
v[i][j+1]==1;
vst_cnt++;
b4=1;
q.push({i, j+1});
}
if(b1 || b2 ||b3 || b4) res++;
if(vst_cnt==ele) return res;
}
}
};
I am getting tle on this...please help me.