Google Coding Question - Making a Large Island (Hard)

[@samyakkumarsahoo8706]

Every struggling coder needs a mentor like you.

[@seanvance3393]

Instablaster

[@TheSkyCries1]

You are the man. I spent all day doing this problem, but thanks to you, I actually understand it now. I can't tell you how much I appreciate you.

[@darthvader_]

The best part about his explanation is he cuts to the chase, where others are engaged in explaining things he has already arrived at the coding part!

[@KushalBhatia]

Thank you for patiently going through the whole grid instead of just saying so and so and moving to code. Amazing explanation

[@AlgosWithMichael]

You're very welcome!

[@fk121276]

Thank you Michael Muinos. Simply the best explainations, when I search I first see if I find a video from Michael Muinos, if not then from Tushar Roy, if not then whatever I get.

[@RajeevKumar-xz2zr]

nicely done! before watching this I watced few other videos but couldn't get anything. 11 minutes of your video and everything was crystal clear.

[@AlgosWithMichael]

Great to hear!

[@stephandowless1297]

this guy does such a great job of breaking complex problems down into simple steps. goes very in depth with examples as well. great job

[@pradnyeshchoudhari9376]

Best and easiest solution that I could ever find for the problem. Thank You!!

[@mk-ec6px]

This is lit 🔥 please do more graph problems

[@AlgosWithMichael]

Thanks dude, will do!

[@lapujain]

Amazing. Your way of explanation is awesome. Keep up the good work.

[@AlgosWithMichael]

I appreciate that, thank you!

[@xeri_zarek]

Thanks for these videos! I've been looking all over for straightforward walkthroughs of algorithms + code for this type of problem, and yours are by far the most helpful I've found :) I did want to ask, why is the time complexity O(N^2)? since the loops you highlighted aren't nested, shouldn't it be O(2 * N) which is just O(N)? Or does the recursion in the getIslandSize method factor into the calculation?

[@AlgosWithMichael]

Of course, thank you for watching! Looping over a grid will be n * m. If the columns and rows are the same, it is n2.

[@user-Sjskakendjsiwjd]

I was initially a bit confused about this too because he said N is the number of items inside the input array, which then should be O(N).

[@wendyzhou7618]

super clear, right on the point. feel so lucky that I ran into this video, thanks!

[@salmanuddin3779]

Such a great explanation , I was able to understand every bit of it. Thank you 💛

[@codestorywithMIK]

Best explanation for this problem

[@RishabhJain-hr6sz]

Perfectly explained. Thank you!

[@chandandigumarthy9652]

Amazing man ! your explanations made it soo easy to understand, thanks

[@AlgosWithMichael]

Glad it helped!

[@amritanshu83]

Awesome explanation dude..so well explained. This is how solutions should be made. Keep up the good work!

[@AlgosWithMichael]

Thanks, will do!

[@kickradar3348]

What an incredible solution! Thank you for this vid!

[@shinansun9438]

Great Video Michael. Very clear instructions

[@hoyinli7462]

watching your video saved me tons of time. THX!

[@rakeshgupta8901]

One of the best explanation I seen

[@AlgosWithMichael]

Thank you!

[@andrewthmas]

Thanks man. You understand what you are doing.

[@AlgosWithMichael]

I appreciate that!

[@Dinesh-ti6ql]

Most satisfying code ever watched😌 keep up the work dude✌

[@AlgosWithMichael]

Thank you, will do!

[@leowu5058]

thank you for making all these great videos for us!

[@Obligedcartoon]

bloody brilliant mate

[@justgame5508]

With some of these hard probables you can get trapped down rabbit holes, trying to solve the problem when you don t fully understand the question, a pen and paper or white board makes them so much easier you can draw things out and quickly see and issues with logic you may otherwise had assumed was sound

[@mengjiasings1278]

I was trying to submit this LC but couldn't get anything. You saved my day:)

[@sara1khan157]

nice explanation . one doubt : if no of rows = n , no of cols = n , then getIslandSize -- is dfs call --- it will take O (n^2) which is equal to no of nodes traversed _ outer loop is also n^2 so total time complexity is O (n^4) Please correct me if I misunderstood Thanks

[@sara1khan157]

got it please ignore the question :)

[@evanliu6158]

Cool! Your explanation cured my panic.

[@AlgosWithMichael]

Nice!

[@AnuragBaidyanath]

GG Michael! Clear explanation. :)

[@AlgosWithMichael]

Glad it was helpful!

[@shruthib3366]

This algo literally blew my mind!

[@AlgosWithMichael]

Haha yeah it is pretty crazy

[@NithinMWarrier]

Thanks Michael, you explained very clearly with time and space complexity. One suggestion is to use proper variable names eg. instead of x, y, newRow, newColumn would be better, good job, keep going bro..

[@AlgosWithMichael]

Great suggestion!

[@nehashinde6017]

You made it so easy!!!! Thank you so much!

[@plvshygirl]

Awesome explanation, thank you!

[@sagarsrivastava7728]

Excellent Explanation!!!

[@joann4369]

how would you explain further why the space complexity os O(N^2)?

[@supratim08]

Great explanation bro ❤😌

[@yy-gf7ze]

Michale is THE BEST.

[@amritgupta5703]

Please make similar videos of interview hot problems. Focus on algorithm like this video so that we C++ people can code easily in our way after getting algorithm.

[@AlgosWithMichael]

Definitely will!

[@jamsrandorjbatbayar3652]

great explanation, much appreciated!

[@AlgosWithMichael]

No problem!

[@momoX7777]

AMAZING EXPLAINATION!!!

[@aayushsrivastava9569]

Great explanation thanks !!

[@roxanamoghbel9147]

your videos are the best

[@code7434]

Really loved the explaination

[@AlgosWithMichael]

Thank you, I'm glad it was helpful!

[@saisriharshagriddaluru9261]

why grid[i][j] > 1 is wrong there? can any one explain?

[@ayonkar1534]

Clear-cut Amazing

[@AlgosWithMichael]

Thank you!

[@anuragsekhri2315]

well explained. thanks a lot

[@FaustoOliveiraFilho]

Really good, man! Your didactics is incredible! You should get yourself a pen; it will make your drawings much easier and better than your mouse.

[@AlgosWithMichael]

Thank you very much! Actually all of my newer videos are animated now, no more drawing with a mouse haha

[@FaustoOliveiraFilho]

@@AlgosWithMichael I have 18 years of experience as a developer and now I'm practicing for an interview at Amazon. Your videos are really handy and your explanation comprehensive without being dull. Thank you for all your efforts!

[@AlgosWithMichael]

No problem at all, I wish you the best with your interviews!

[@code7434]

Shortest bridge is similar problem please cover it

[@AlgosWithMichael]

Definitely! Graph problems are the hardest imo

[@Arun1995plus1]

Thank you 🙏🏾

[@kaushaldawra3527]

Is there a fan club I can join?

[@kumarc4853]

Very KIND of you :p

[@shoyohinata1612]

Dude you are great..!!

[@himanshuchhikara4918]

best explanation

[@AlgosWithMichael]

Thank you!

[@angelsancheese]

thank you for the video

[@AlgosWithMichael]

No worries!

[@sanjayizardar2263]

Very helpful 👍

[@AlgosWithMichael]

Glad I could help!

[@edwardteach2]

U the Goat

[@amritgupta5703]

This is LIT

[@AlgosWithMichael]

🔥🔥🔥🔥 Thanks man haha

[@code7434]

Nice

[@AlgosWithMichael]

Thanks!

[@shreejitnair2174]

wow beautiful

[@AlgosWithMichael]

Thanks a lot!