CANDY CRUSH (Leetcode) - Code & Whiteboard

A problem that's been very popular with Bloomberg and Facebook, Candy Crush is based on the algorithm in the very popular mobile application game. Here we do a walkthrough of the solution of how to crush the candies until stable-state is achieved.
Let me know if you have any questions about the solution, or would like help with any other part of your studies + preparation!
leetcode.com/p...
---------------------------------------------------------------------------------------------------------------------------------------------------------------
Let's connect on LinkedIn!
/ aleksmitrovic
Follow me on Medium!
/ mitrovic.aleksandar
Questions or suggestions for new videos? Email me!
[e-mail]

[@nayankhanna2367]

Thanks for this detailed explanation, Loved it! The analogy with Moving Zeroes problem made it a lot easier.

[@babybear-hq9yd]

so happy it helped!!

[@adityasharma1940]

That was a great explanation. Especially referencing move zeros question helps to put things together. Thanks.

[@babybear-hq9yd]

Thx Aditya! :)

[@victorialamanova7189]

Thanks for making the interview preparation less painful!

[@babybear-hq9yd]

happy to help!

[@gskandspot]

this video is EXTREMELY helpful, really well explained

[@babybear-hq9yd]

Tysm! Took a while, glad it was worth it :)

[@angelotessaro]

It was a great explanation, good work man! I think the longer video was actually necessary to explain the entire solution and it was very clear :)

[@babybear-hq9yd]

Thanks brotha!! I'll make sure to keep the daily content coming and similar to this video :)

[@adyamohanty2810]

As always, very detailed and easy to understand explanation. Thank You.

[@babybear-hq9yd]

thank you adya!! :)

[@addyjaiswal2309]

God tier explanation, i didn't did the moving zero problem but the explanation was so easy to understand.

[@babybear-hq9yd]

Thanks bro!!! Once you do Moving Zeroes it’ll be even easier :)

[@pranybany]

Great! way to explain. Appreciate your effort.

[@babybear-hq9yd]

Pleasure’s all mine! Glad it helped :)

[@CongNguyen-og3iz]

Hands down the best out there. Thank you!

[@babybear-hq9yd]

thanks bro

[@softwareengineeringintervi4928]

If we do everything in a while loop instead of using a recursive stack, would that make a difference? (talking in terms of space-complexity) - however, loved the explanation!

[@babybear-hq9yd]

Hey there, great point! I didn't even notice that the first time around. I've just tried to refactor the code, and it indeed can be done with a couple of small modifications :) Thanks for the shout!

[@sensen338]

Worth to watch a long video especially for this kind of a problem :)

[@mr.anonymous6098]

Great explanation!

[@babybear-hq9yd]

tyvm :)

[@MaminaZvezdochka]

Thanks so much! Nice to listen and easy to understand with your help

[@babybear-hq9yd]

Hahah thanks Larisa, super glad you enjoyed it :)

[@nova2577]

Such a great and crystal clear explanation with fluent English. BTW, you are handsome, Lol. :)

[@babybear-hq9yd]

hahaha happy to provide in more ways than one!

[@binarybeast2685]

Hahah, if something work's don't change that :-P, on a serious note a huge thank you for making these videos!

[@babybear-hq9yd]

Hahahah my pleasure. Glad you enjoy them

[@kartiksingh1273]

Really helpful. Thanks, Man!

[@babybear-hq9yd]

my pleasure buddy

[@utkarshsharma1550]

Hi @babybear4812! Not a major correction but just a minor one: in case of error checking it will be "return board" not just "board". Thanks for the amazing video! Cheers!!!

[@babybear-hq9yd]

Whoops… good catch 😁

[@parshvatimbadia9454]

You are amazing

[@peifeili67]

love the clear explanation

[@babybear-hq9yd]

Thanks a lot Peifei! Glad you enjoyed it :)

[@gadgetguy6651]

Amazing explanation! Very intutive and elegant indeed

[@NateGUMBC20]

very helpful, thank you!

[@babybear-hq9yd]

My pleasure buddy!

[@elainaheraty3355]

great explanation and super clean! thanks :)

[@babybear-hq9yd]

Thank you, Elaina!! Super happy you liked it :)

[@abdulkk49]

Great explanation

[@aparajitasengupta5558]

Thank you, this is a great help!

[@babybear-hq9yd]

my pleasure :)

[@ritikarana757]

Awesome and nice explanation

[@Nara-ec1jc]

Great video, thank you for sharing.

[@nova2577]

Subscribed!

[@joann4369]

What would the time and space complexity be? I’m thinking O(M+N) because we loop through the rows and cols?

[@babybear-hq9yd]

I don’t remember, but since we’re going through the whole grid my guess would be O(M*N). May be a bit more to it given how we’re crushing the candy and dropping them down but still stand by my initial thought

[@imelbertkim]

You are the man!

[@babybear-hq9yd]

Thanks Elbert!!!

[@FitnessChaos]

Good explanation

[@woodylucas]

Great video, it’s just the logic for the gravity part is throwing me off

[@babybear-hq9yd]

The gravity part is actually just a rendition of the "Move Zeroes" problem on Leetcode, Problem 283. In "Move Zeroes" we need to take any zeroes and move them to the end of the array, while maintaining the order of the rest of the elements as they were.
Except in this case we need to think about that problem vertically instead of horizontally. We're moving"the negative numbers to the "end", or essentially the top of the 2D array.
I don't think I have a video up on it because it's been reviewed a lot already. However, the solution is available on Leetcode. I would suggest the solution they covered in Approach 2. It's in C++, but the logic is identical to what I did here. Hope this helps! :)

[@woodylucas]

@@babybear-hq9yd I actually just solved that problem, and it really helped. Thank you

[@ravaligampa1232]

Can you talk about space and time complexity.

[@RG-yj4cb]

the presenter went into details which are required for this kind of problem; Must watch - though watch 2x then you will have it!

[@moorchini]

#Legend

[@user-dc8kp2ei4h]

Request for toonblast leetcode

[@AiminglowNAccpble]

12:16

[@khadijakhaldi6468]

Great explanation!