Rotten Oranges (BFS) | C++ & Java Code |G-10. Rotten Oranges

[@takeUforward]

Please watch our new video on the same topic: kzbin.info/www/bejne/r5eWoIieoNukd5I

[@ahishnar1568]

About to practice this question and notification appeared. What a timing 😅 Consistency 🔥🔥🔥 Thanks for the video Bhaiya.

[@gauravgautam5963]

literally . I have to say you explain it very well. As i have tried from many video to understand this question but your way of explaining is on another level

[@sumitkulkarni3950]

geeksforgeeks has very lengthy code for this question. You have simplified it. Thanks

[@takeUforward]

Please like, share and subscribe to these kind of content also. Do let me know in comment section if you have understood or not :) New and better edition: kzbin.info/www/bejne/r5eWoIieoNukd5I

[@AmanKumarSinhaOfficial]

Please Bhaiya... Make a video for BCA Student who wants to get job just after completing BCA - Off campus roadmap...

[@takeUforward]

@@AmanKumarSinhaOfficial areh mene wo chiz kia hi nai, toh video kese banaye bhai.

[@AmanKumarSinhaOfficial]

@@takeUforward .......

[@ratnadeepbhattacharya3237]

Bhaiya trees ka series kab ayega like approximate time kuch? BTW nice explanation.....keep up the gd work 👍

[@manaswitadatta]

Hi, can you pls provide the link for the SDE theory topics sheet. I remember seeing it but can't find the link. Pls.

[@laraibanwar1618]

I really appreciate your work what you are doing for the students of college level I am already working in a company but I do codeforces generally One algorithm on which I had the most difficulty was line sweep algorithms Can u make videos on that topic for the students It would be great U can find the sources from hackereath and topcoder as well or from cp algorithms Thanks

[@teetanrobotics5363]

Thank you striver for your amazing playlists. Could you please make a playlist on "STRINGS" as well ?

[@RonitChattopadhyay]

Hello Striver Bhai.. Thanks for your hard work. Your videos are followed not just by students, but experienced software engineers also like me.

[@tanmaysinghal8370]

nice way to check the count of how many rotten oranges are there ... i just used a double for loop to check if there is any 1 left in the matrix... couldn't think of your way

[@dhruvsharma7964]

Great video, just need a clarification. You have told in live class that we should never change the given value in input, but here you have modified the grid.

[@takeUforward]

Yeah if I was giving interview, I would have asked the interviewer, here i was solving a lc problem, so did it like this.. General order: Ask the interviewer, generally they will ask you not to modify it :)

[@dhruvsharma7964]

@@takeUforward In that case should I make a copy of the grid and then modify that or is there some better way?

[@HarivanshKripaVlogs]

That happiness when your video appears at the top..!!! Aab to ache se samajh aa jayega

[@bhaveshkumar6842]

I am the biggest fan of the way you teach and I also get to learn how to write neat code.

[@alternative8234]

Brother you're doing a beautiful work. Hope to thank you in person someday.

[@akshatsemwal_14]

BHAIYA PLEASE MAKE A VIDEO FOR A FRESHER 1ST YEAR IN TIER 3 COLLEGE COMPUTER SCIENCE BRANCH. 1. ROADMAP STARTING OF COLLEGE TILL END OF PLACEMENT A PROPER DETAILED ONE WITH SOURCES OF SITE OR APP TO PURSUE CODING COURSES TO GET PLACED IN TOP MNC's 2. ALSO, COMPANIES AND TIME AT WHICH ONE SHOULD APPLY FOR PAID/NON-PAID INTERNSHIPS. 3. ALSO PROPER TIME ONE SHOULD INVEST IN HIS CO-CURRICULAR ACTIVITIES + CODING + COLLEGE STUDY. 4 . AND EVERYTHING ABOUT GATE EXAM WHETHER ONE SHOULD THINK ABOUT IT AND HOW TO MANAGE BOTH ROADMAPS AS WELL AS PREPARATION AND ALSO WHEN TO PREPARING FOR GATE. 5. STUDY MATERIAL TO FOLLOW IN ORDER TO MAINTAIN COLLEGE GRADES. PLEASE BHAIYA DO MAKE A VIDEO!!!

[@karanudayandas1608]

Time and Space Complexity :- 25:06

[@baranikumar6220]

Clear explanation . You made it quite easy to understand this problem. Thank a lot !

[@dheerajgoyal6471]

in the if statement of c++ code where you are checking the !=1, there can be a value which is equal to 0 and in that case why we have to mark that as 2(rotton) the if will also contain(&&grid[nx][ny[!=0)?

[@takeUforward]

Only if its 1 we mark else we don’t

[@tulika2863]

How to think whether BFS or DFS should be applied on the grid? I always get stuck in this. Please reply.

[@takeUforward]

Its a standard problem. Generally when there is a pattern of movement. Like here its always 4 directions. Both bfs and dfs can be applied.. Dfs is preferred when we need some backtracking stuff. Here we did not, so bfs dfs both work fine

[@vighneshhegde4580]

Like, whenever u are seeing that it is radially increasing, then there is a strong chance that BFS will be applicable over there

[@tulika2863]

@@takeUforward Thank you 😇

[@tulika2863]

@@vighneshhegde4580 Thank you 😇

[@samgodse9771]

You are Great Striver ! Keep it Up | No one Provides This Level of Contents Even Paid Courses can't match with Your KZbin Free Contents. Thank you

[@lakshminagaraju206]

Thank you for the great explanation. You are truely inspiration

[@bhavyanayyer3391]

Sir pls make video on distinct subsequences (dp) and regular expression match pls🙏

[@nishchaygupta9988]

Hey, the overall explanation is great. But I have one doubt in the S.C. It should be O(n*n) + O(2n) for vector of vector and queue.

[@Lovekush-kx5kz]

Ya it can be but overall it becomes O(n*n)

[@nishchaygupta9988]

@@Lovekush-kx5kz alright

[@kabirbanerjee6159]

Thanks bhaiya for explaining the problem in such an amazing way . I am currently in first year and I have solved most of the questions in the SDE sheet myself . Bhaiya I want to ask a question that from second year should I learn web development or android development and focus on dev related things or should I continue with problem solving . Bhaiya please reply.

[@abhinavshukla6418]

i am a student of DTU ,is CP necessary for beiing placed in a gud company ,isnt leetcodde nd gfg sufficient??

[@bharatpipare7655]

Bhaiyya Will you please explain us the Time complexity n It's notations in a simple way, I am facing difficulty while understanding.

[@aryanyadav3926]

Thanks for the brilliant explanation!

[@itianshub5650]

Great Explanation Bhaiya. Thnk u...

[@unnatimishra]

I badly needed this video, Thank Youu for making 🤩

[@aarushi6601]

Will using dfs make the problem complicated? Is that why it is not used

[@jaiminsolanki5478]

We can't thank you enough Raj Bhaiya!

[@adityatiwari1022]

can this problem be solved using recursion?

[@sukritakhauri65]

Loved the explanation

[@dollyyadav3251]

y u did'nt maintain a visited grid so that while making call in 4 directions we don't need to recompute for the previously visited cell of the grid.

[@rishabhkumar8115]

can someone please explain me why we are updating our day only when the q size is not 0, . it becomes zero in last iteration so our day will become less then 1??

[@jatilyadav4000]

amazing explaination

[@himeshgupta6478]

I am from non cse background can you please guide me. What kind of questions are asked from operating systems for placement interviews??

[@shrimpo6416]

GREAT explanation and very clean, elegant code!

[@kundanranjan]

How does the algorithm make sure that the time taken is minimum ? Or I think the time is fixed and there can not be any minimum or maximum time. Correct me if I am wrong.

[@SantoshSHARMA-vb1kv]

hey striver!! can u plz tell why this code is creating problem as it is error ....if u can guide it'll be really very helpful

[@vikashkumar7762]

Bahut shi explain kia h BOSS

[@pallavibhasme13]

Hi ...can plz make a video on, how to make project... I'm 3 yr student but don't know how to make even staring of projects , and which topic is to select... plzz

[@yeswanthh5068]

Understood sir

[@sushantkhattar2598]

Very well explained solution.Thanks 👍

[@ytsh5752]

Thanks sir

[@stutij7922]

What will be the time complexity if I solve using DFS I will have to call DFS multiple times to ensure that final time is minimum. Could you plz explain time complexity in dfs

[@ore_wa_king]

Thank you Sir

[@nitinshukla4960]

Thanks Striver Buddy

[@codeguy21]

consistency level 100...

[@_-6912]

I understood the solution!

[@jatinagarwal1605]

What if grid does contains more than one rotten oranges then code doesn't seems to work since count_fresh!=cnt in that case..correct me if I'm wrong

[@lifegood6401]

Superb Explanation as always..

[@bhaveshkumar6842]

Thank you, Striver!!!!

[@ayeshasumaiya8280]

Best Explaination💯

[@manasdeora4601]

Amazing explanation man!

[@jatilyadav4000]

thank you soo much ...highly appreciated

[@freshcontent3729]

bro upload more videos like reverse the string with all approaches

[@chandangunaga6810]

Doubt!! Doubt!! Sir please do check my comment... I am in my end of 3rd year and i am from a tier 3 college... I have started my DSA journey... I m refering your SDE sheet I have doubt in my way of learning it.. I am seeing your solution tutorial , understanding the problem, and write the code by myself after watching the complete video... Is this method is right?or Any suggestion frkm you sir so that i can get a placement in PBC?

[@takeUforward]

Way to go

[@KshitijJain]

Hey, Can you please cover Trapping Rain Water problem please.

[@takeUforward]

I did

[@KshitijJain]

@@takeUforward it should be also in stack playlist?

[@swetajha2265]

good explanation!!

[@pedadagopal3062]

brother,if possible try to also make videos of problems in cp sheet and cr sheet.Also some hackearth links are not working in cp sheet it is showing 404 not found.

[@abhishekagarwal3843]

I want the next video on Rabin karp and z algorithm please!

[@angshuman_roy]

​I m in my last year but still struggling with basic dsa ,what should I do considering I do have now a time constrain ?

[@abhinavshukla6418]

bulk recruitment

[@rajatverma7936]

its Just Wonderful

[@AmanKumarSinhaOfficial]

Please Bhaiya... Make a video for BCA Student who wants to get job just after completing BCA - Off campus roadmap...

[@AdityaPrakashSinha]

👍👍👍

[@Ryan-mr9pn]

Why the dfs approach wasn't chosen here and instead we went with bfs

[@tusharrustagi5729]

understood

[@freshcontent3729]

Conintute the sheet bro placements are startinig! increase upload frequnecy and thanks again

[@sankalpmehadia9252]

An alternate solution using O(1) space: class Solution { //Function to find minimum time required to rot all oranges. public boolean check(int[][] grid) { //checks if there is some fresh orange and mekes all -1 to 2 so we don't need extra space int n=grid.length; int m=grid[0].length; boolean b=true; for(int i=0;i

[@takeUforward]

this isn't o(1) space, when you modifying the given data, we consider that into space complexity as well.. Also interviewers don't like such solutions where you modify the give grid..

[@sankalpmehadia9252]

@@takeUforward Ok thanks for informing!!

[@Mysterious_debris_1111]

Wonderful content. Thanks man !

[@aswinaspirant4100]

Amazing brother !

[@nileshsinha7869]

Great explanation as always🔥❣️

[@codewithme9016]

That is clear 👍

[@VirajChokhany]

Thanks striver. OP explanation 🔥

[@gauravshukla6675]

kabhi kabhi sochta hu striver bhai ko doubt ayega to vo kisse samjhenge

[@satyampande684]

understood!!

[@fardeenshaikh6434]

Eid Mubarak Bhaiya

[@PrinceKumar-el7ob]

As perfect as always !!

[@rishabhkumar8115]

if(like_button != 1){ while(1){ like_striver_video(); } } really, such a nice man you are and very very helpful.

[@manasharsitraj3226]

Love you sir

[@dhanashreegodase4445]

why bfs? and not dfs

[@vimalmaury9745]

Why r u so awesome 🌝btw thanku so much keep helping us

[@amansamal8233]

understood❤❤

[@radhe1335]

Striver OP 💥💥🔥🔥

[@surajkumarsingh4857]

Keep going brother 💯💯

[@whatsupdiv]

noooo its over

[@cy.sumit02]

Found u raja da It's Barce ❤️

[@takeUforward]

Haha

[@AshishKumar-pq6pr]

Maja aa gya 😅🤟

[@rajananarve5089]

Hi

[@SahilSharma-vl9rk]

Eid Mubarak bhai jaan ☺️❤️

[@takeUforward]

Eid mubarak

[@e889.]

💯

[@saurabhsingh-sy4oh]

🙌🙌

[@pabitradakua8113]

Bhai 🔥

[@kunalsihare5244]

bhiya your voice is not clear bad mike quality

[@takeUforward]

Okay bro. Did not find this feedback from anyone, still will get this checked! Thanks

[@himanshu298]

Please enjoy your vacation instead of uploading videos..