Rotting Oranges | leetcode 994 | Hindi

liked this video? Click here / @codebix1096 join facebook group :- / 258049468776636
problem :- leetcode.com/problems/rotting...
code :- github.com/luckykumardev/leet...
graph playlist :- • Graph Intoduction

[@rohan8758]

great explanation making use of pair object which is very unique. Padaane baalen toh bahut mil jaayenge but acche padaane waalon ki kami hamesha rhegi! Nice explanation sir ji!

[@tripti892]

i was asked this question in amazon interview and thank god i had seen this video i was able to explain nicely

[@madhurbhargava]

भाई, एक बार फिर से बहुत ही अच्छा समझाया आपने | बहुत धन्यवाद |

[@nitin9042]

Single minute of time is not wasted here. Kudos hats off great explanation.

[@deepikabhatt21]

simple or to the point explanation

[@shantanukumar4081]

Great Explanation. Thank You So Much.

[@sonalisaxena22]

Very Well Explained...ThankYou...so much :)

[@chetannikam8129]

perfectly explained.................great----------------love u sir g

[@roushanraj8530]

Bhaiya literally, 5 videos dekha clear ni hua concept fully, then i saw your this video, ek baar me sb dimag me chala gya, awesome bhya, thank you so much
Me toh skip krne wala tha ye question 😅

[@codebix1096]

Thank you.
Glad you enjoyed.
Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@shivanshbajpai588]

I also figured out the code but yours is much optimised
Good Work

[@codebix1096]

Yeah thanks

[@piyushjain5852]

Thanks, man! your video tutorials are really helpful! I appreciate your hard work and the time you are investing in helping others...

[@codebix1096]

Happy to hear that!
Thank you.
Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@rupdeepthey]

Best!!

[@arunkumaragrawal7486]

Which compiler u used to run this code?

[@pawancricket13]

ultimate !!

[@letsdoeverythinginoneweek9398]

perfect

[@kanishkarrajeswari8315]

Brother, thank you for the explanation, it was neat and understandable,
I have a doubt, while reading the question on leetcode, and while reading it, i thought it was, depth first search, since connected oranges are the ones that get degraded, but while coming to your video for further explanation and clarity, I got the idea of Breath first search, so, my doubt is how will identify a question say, X, can be solved by BFS or DFS? is there any trick into it.
Thanks

[@ritwik121]

if asked for *** minimum **** something like here it asked for minimum time think of bfs . also one of the key intuition to use multisource bfs is that it is mentioned in the question - Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.

[@sharuk3545]

awesomee explanation

[@vinamrasangal8436]

nice lucky

[@kkoyal6853]

Meko aisa q lg rha Bassi padha rha h, 😅 btw great work man ye video best h is topic pe

[@sukhdevsharma5611]

Awesome

[@acxd]

best explanation of this problem!

[@codebix1096]

please share this channel with your friends

[@rechinraj111]

We have not used here concept of VISITED ARRAY because we are checking if orange is good then only we are making it rotten & adding it to queue. Am i right ?

[@codebix1096]

Yes you are right

[@deepakkoushal56]

top most best explanation on youtube

[@codebix1096]

Thank you.
Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@DhageFamily7]

nice explanation

[@pranavmodi4984]

bhai how it will check for the cases when there are more than 2 oranges at different places as both will take the same time to rot oranges adjacent to it. Here we are popping one after the other and incrementing time in every iteration. although two oranges at different places will rot the adjacent ones at the same time and not different time. for example
2 1 1 0
1 1 1 1
0 1 2 1
In the above matrix (0,0) will rot (0,1) and (1,0) at the same time as (2,2) rots (2,3),(1,2) and (2,1)...
Can you please explain this If you have handled because I am not able to understand this?
Thanks in advance and keep making great videos.

[@arunkumaragrawal7486]

What is time complexity of this code??

[@aniketsriwastva6345]

great explaination

[@codebix1096]

thanks please share this channel with your network :)

[@pushkardureja6863]

Can we solve it using dfs??

[@kamlendratripathi8963]

sir time complexity ky hh

[@Atom404]

superb explanation bro keep it up

[@codebix1096]

Thank you so much 🙂
Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@rechinraj111]

I guess this problem can be solved using concept of FLOOD FILL also. Plz confirm.

[@codebix1096]

Yes very similar i said it is "grid wala type problem"
Some of the similar problem are
Number of island
Number of enclave
Flood fill
Min no of step by knight
.
.
.
.
I will try to cover all these problem so keep watching 😀

[@rajkumarchaudhary6783]

bhai BFS or DFS pe ek acha sa video bhaoo pla its very important,, Thanks in Advance

[@codebix1096]

Already bna rkha h check my graph playlist

[@rajkumarchaudhary6783]

@@codebix1096 Thanks brother for your efforts.

[@AYJ959]

😅you sound like sumeet sir

[@sachindeshpande4521]

Nice bro

[@codebix1096]

Thanks

[@jeeveshjoshi129]

Sumeet Sir is that you?

[@45sachindige14]

Ye cheez kaha use huti hai plz tell me

[@codebix1096]

kya cheez?

[@codebix1096]

join this facebook group to get updates of upcoming videos and discussions
facebook.com/groups/258049468776636/about

[@45sachindige14]

Rotting oranges techniques bhai

[@codebix1096]

Sachin esme basically check kr rhe h kmko bfs lgana aata h ya nhi shortest path/min time nikalne kae leye.. orange rot ho gya means vo visit ho gya kuch ese relate Krna esko

[@sahilkumarsingh2531]

Understood in a great way! Thanx sir🫡