Rotting Oranges | Directional Arrays & BFS | LeetCode

[@iameenr]

Micheal, you are literally the most underrated creator I know now. Keep up this amazing work. And your code quality is Kick Ass. 🔥

[@AlgosWithMichael]

Haha thanks so much, I appreciate it!

[@micosair]

Nice trick to store i,j in a single variable.Thanks for sharing.

[@AlgosWithMichael]

No problem!

[@vivek.tiwary]

As always, best explanation. Best part, how to approach this kind of problem, no one talks about intuition except you. Thank you

[@TheElementFive]

Couldn’t have been explained or visualized more effectively!

[@yunyixu5994]

So underrated!!!💯 Thank you for your work!

[@yaboyspence]

Could the if-check (lines 19-21) be included in the top for loops? Just curious why we need to iterate the grid twice?

[@odrare]

Man, that's amazing, thank you

[@odrare]

also we can write this for(int i = 0; i < m; i++) { for(int j = 0; j < n; j++) { if(grid[i][j] == 1) { ++freshOranges; } else if(grid[i][j] == 2) { queue.add(i * n + j); } } }

[@kavyak.p8878]

Could you please make a video on Leetcode 753. Cracking the safe. It’s a hard problem

[@prithvirajrathore4256]

Congrats for Google bro🎉🎉 . I also want to switch my current job to google . Can you help by covering the topics which google developers ask most.

[@dvfrost6227]

Unable to pass all the testcases on Leetcode