As soon as the original size of q equals to zero it means one level is completed and also ensures that our one step has been taken and this is the real backbone of the problem.learning ++ bhaiya
IITian +Master degree holder+ Gate rank holder+Top company did jobs+depth knowledge+industrial knowledge+sharing practical+theory knowledge=no deserve anyone better him. We love ❤ his hard work. We must be supportive and grow his channel. It is our responsibility. Comments,like and share are small efforts for us but it helps a lot for his hard work and help do for more such amazing content.
Bhaiya aap disappointed maat hueye koi dekhe ya naa dekhe mjhe pata hai or experience se khahata hu isse best DSA series maine nhi dekhi jo nhi dekh Raha uska nuksan ❤❤
bhaiya plz complete this series you are iitian if you want then you can upload even 2 lecture per day plz plz i assure you i see every lecture you upload i want to learn dsa as soon as possible not know why 😅
Bro everyone has a personal life and work to do. You're watching him giving one lecture per day but behind the scenes he has to research all day long. So don't force him for more. What he has already given us is beyond cost❣️
If i am blocking the way to go back by making the current cell 0 while popping out from queue and not while pushing the pair, why am I getting runtime error? Edit: I'm talking about shortest path question
BFS: class Solution { public: //Function to find whether a path exists from the source to destination. int row[4]={1,-1,0,0}; int col[4]={0,0,1,-1}; int r; int c;
DFS: class Solution { public: //Function to find whether a path exists from the source to destination. int row[4]={1,-1,0,0}; int col[4]={0,0,1,-1}; int r; int c;
Code Using BFS class Solution { public: int row[4] = {0, 0, 1, -1}; int col[4] = {1, -1, 0, 0}; bool isValid(int i, int j, int n){ return i>=0 && i=0 && j
1:10:13 Homework BFS : class Solution { public: int row[4] = {-1,1,0,0}; int col[4] = {0,0,-1,1}; bool valid(int i, int j, int n){ return i>=0 && i=0 && j
DFS Solution for 3rd problem. class Solution { public: int drow[4] = {-1,0,1,0}; int dcol[4] = {0,1,0,-1}; bool dfs(int row, int col, vector& grid, int n) { // base case if(grid[row][col]==2) return true; // insted of visited array...... grid[row][col]=0; // traverse over child for(int k=0;k=0 && nrow=0 && ncol
Vote for depth videos📹
Bhaiya sab ekdum chamak gaya ❤❤
Guys please iss playlist ko jitna ho sake utna share karo taaki Indian students ko real DSA ka experience mile 🤗🤗
Good morning bhaiya ji.. Guys please share this with everyone DSA Aspirant. 💖
Bhai❤️
As soon as the original size of q equals to zero it means one level is completed and also ensures that our one step has been taken and this is the real backbone of the problem.learning ++ bhaiya
Yes❤️
Isko pure social media mei felodo guys. This course deserve it.
after the explanation of concept I have done all three questions in one go.. ♥
Aapka video dekh ke din bn jaata hai❤
Bhai❤️
I bet this channel will get millions of views 😊
Thank you so much bhaiya❤
Never seen such a dsa course like this🔥🔥🔥
Bhaiya aap hamare liye bahut mehnat kar rahe ho,
Dil se thank you ❤
Bhaiya ne aag lga di pure industries me....❤
IITian +Master degree holder+ Gate rank holder+Top company did jobs+depth knowledge+industrial knowledge+sharing practical+theory knowledge=no deserve anyone better him. We love ❤ his hard work. We must be supportive and grow his channel. It is our responsibility. Comments,like and share are small efforts for us but it helps a lot for his hard work and help do for more such amazing content.
In depth and awesome teaching bhaiya
Bhaiya aap disappointed maat hueye koi dekhe ya naa dekhe mjhe pata hai or experience se khahata hu isse best DSA series maine nhi dekhi jo nhi dekh Raha uska nuksan ❤❤
Solution 3:
class Solution
{
public:
int row[4]={1,-1,0,0};
int col[4]={0,0,1,-1};
bool valid(int i,int j,int n){
return i>=0&&j>=0&&i
Best series for DSA ✨✨
maza aagaya bhaiya ji pls continue this series😍😍👍👍
u r gonna reach at the top of u tube teaching section for sure....lots of best wishes😇
Simile bahut killer hai aapki bhaiyaji ❤❤❤
Thank you bhaiya for depth explanation ❤
Don't be disappointed sir....our blessings are with u
Jai shree Ram ❤️
Dhanyawad ekdum OP lecture 😊
Awesome Lecture Bhaiya 💓💓💓💓
Thank you bhaiya ❤...pura chamak Gaya
bhaiya plz complete this series you are iitian if you want then you can upload even 2 lecture per day plz plz i assure you i see every lecture you upload i want to learn dsa as soon as possible not know why 😅
Bro everyone has a personal life and work to do. You're watching him giving one lecture per day but behind the scenes he has to research all day long.
So don't force him for more. What he has already given us is beyond cost❣️
Good morning Bhaiya
Amazing lecture bhaiya🤗
1:10:44 DFS :-
const int row[4]={-1,1,0,0};
const int column[4]={0,0,-1,1};
bool isValid(int i,int j,int N)
{
return i>=0 && i=0 && j
thanks bhaiya owesome lecture
Bhaiya love u .aapke wajah se mera 27 lpa ka ctc laggya atlassian mein
amazing explanation sir!
Bhaiya please upload regular videos!!!
Great, 🎉❤
Aap bhagwan ho Prabhu 🙏🙏🙏😭😭 bhai isme pura padhye ho na
You are Great Bhaiya ❤❤
such a good lecture
Thank you for backing
Bhaiya recursion ki marathon class Lelo naa please kitni bar bol Chuka hu ❤
Very Cool Problems😊
Gud morning Bhaiya...
Awesome content ,👌👌👌😊😊😊
Hey tumse vo parallel course vala question ke saare test cases pass hue ?as I have also shared my code to you as mere bhi pass nhi hue the saare
Awesome lecture Bhaiya❤❤
Maja aa gaya bhaiya nice explanation
attendance completed, thanks bhaiya
bhia revising the old concept mean solving question related to the topic or just going through the question discussed in the lectures ? please reply ❤
Thanku Sir.
Thank you ❤
THANK YOU SIR !
Informative video 😁
amazing
If i am blocking the way to go back by making the current cell 0 while popping out from queue and not while pushing the pair, why am I getting runtime error?
Edit: I'm talking about shortest path question
Great lecture ❤❤
Nice content bhaiya
nice explanation 👍
GOOD MORNING BHAIYA G ❤❤❤❤❤
Day 16/60 done
Sab kuch chamak gaya ❤
Thank you sir
thank u bhaiya
Bhaiya Radhe Radhe 🙏
Radhe Radhe Bhaiya ❤️
Problem chamak gaya bhaiyaji chamak ++
Good morning sir ji
😇 thankyou sir
maja aaya
Ossum 😊
Thanks bhaiya
amazing❤
Bhai please ye playlist complete kar dena
does anyone submitting in october 2024 getting TLEs for similar structures code using BFS where only 10 test cases are passed ?
Thank you bhaiya ❤
Long video plz sir
BFS:
class Solution
{
public:
//Function to find whether a path exists from the source to destination.
int row[4]={1,-1,0,0};
int col[4]={0,0,1,-1};
int r;
int c;
bool valid(int i,int j){
return (i>=0 && i=0 && j
DFS:
class Solution
{
public:
//Function to find whether a path exists from the source to destination.
int row[4]={1,-1,0,0};
int col[4]={0,0,1,-1};
int r;
int c;
bool valid(int i,int j){
return (i>=0 && i=0 && j
Jai Hind Jai Bharat ❤
Finally new video
Code Using BFS
class Solution
{
public:
int row[4] = {0, 0, 1, -1};
int col[4] = {1, -1, 0, 0};
bool isValid(int i, int j, int n){
return i>=0 && i=0 && j
Perfect
Mayne khela hai chess bhaiya ji
Day 212 ✅🔥
Day 16 ✅🔥
1:10:13 Homework BFS :
class Solution
{
public:
int row[4] = {-1,1,0,0};
int col[4] = {0,0,-1,1};
bool valid(int i, int j, int n){
return i>=0 && i=0 && j
bhaiya graph kb khtm hoga??
Super 😍
DFS Solution for 3rd problem.
class Solution
{
public:
int drow[4] = {-1,0,1,0};
int dcol[4] = {0,1,0,-1};
bool dfs(int row, int col, vector& grid, int n)
{
// base case
if(grid[row][col]==2)
return true;
// insted of visited array......
grid[row][col]=0;
// traverse over child
for(int k=0;k=0 && nrow=0 && ncol
Gd morning brother
Day -16/60
🔥🔥🔥🔥🔥🔥
Yr bhaiya itte axe se kon smjhata h
🙇🫂
Jay hind Rohit baheya 🇮🇳
Graphs++ ❤
using BFS traversal
int row[4] = {1,-1,0,0};
int col[4] = {0,0,1,-1};
bool isvalid(int i,int j,int n){
return i>=0 &&i=0 && j
❤❤❤❤❤❤❤
Done
23:09 legendary moment 🤣🤣😂
bhai aap backtracking aur greedy method, in topics ke bhi problems agar kara dete toh maza aa jata... (not criticizing)
Yes we will do, hashing bhi pending hai DP, segment tree, trie… sab karenge cover❤️
method chamak chuka hai
Bhaiya you make the graph problem easiest
🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥
Day - 16/60 #60DaysOfCode
class Solution
{
public:
bool is_Possible(vector& grid)
{
int ir;
int ic;
int fr;
int fc;
int dr[]={1,0,-1,0};
int dc[]={0,-1,0,1};
for(int i=0;i
reached till here