amazing🥵🥵
Damn!!, Too impressive. I haven't made any this complex projects. Hope i ll finish it in one month, or a year atleast.
this is so cool !
Thank You so much! Can you share 2 pointer approach for the problem.
Great
What did you use to make the grid?
A two dimensional array of div elements
i am having an issue with animating the wall where my mouse down doesnt get registered can u say y did that happen and how did you get around it
Clement milisu did same project
Yes I mentioned that in the video description
Bro it's amazing Just wanna know how much you devoted for this
Thank you :D hmm I think 1 week
@@hishammaged3300 just 1 week? how many hours per day
great explanation
Right on bruv right on 👌🏽👌🏽👌🏽💯💯
🔥🔥🔥💯💯💯💯💰💰💰💰
Great explanation. It's sad to see that you stopped uploading, hopefully we will see more of those videos.
hey brooo please make tutorial in deep about this
Thank you so much!
you're absolutely welcome
Love the project.
Glad you liked it :D
Path finding algorithm ms bs as gg gn e2
P. S note / The index starts from Hisham
As gg wp gn zl e2
❤️💪💪👌👌
please do k-way merge pattern if possible
loved the explanation hoping for more such awesome explanations . thank you
wow!...really nice explanation...please make videos of other patterns like k-way merge and subsets
Thank you :D I've posted a video explaining the top k pattern, It's very similar to K-way merge
Such a smooth explanation! Actually helped me understand that kind of problems Thank you
albyy ❤❤
😍
Пікірлер
amazing🥵🥵
Damn!!, Too impressive. I haven't made any this complex projects. Hope i ll finish it in one month, or a year atleast.
this is so cool !
Thank You so much! Can you share 2 pointer approach for the problem.
Great
What did you use to make the grid?
A two dimensional array of div elements
i am having an issue with animating the wall where my mouse down doesnt get registered can u say y did that happen and how did you get around it
Clement milisu did same project
Yes I mentioned that in the video description
Bro it's amazing Just wanna know how much you devoted for this
Thank you :D hmm I think 1 week
@@hishammaged3300 just 1 week? how many hours per day
great explanation
Right on bruv right on 👌🏽👌🏽👌🏽💯💯
🔥🔥🔥💯💯💯💯💰💰💰💰
Great explanation. It's sad to see that you stopped uploading, hopefully we will see more of those videos.
hey brooo please make tutorial in deep about this
Thank you so much!
you're absolutely welcome
Love the project.
Glad you liked it :D
Path finding algorithm ms bs as gg gn e2
P. S note / The index starts from Hisham
As gg wp gn zl e2
❤️💪💪👌👌
please do k-way merge pattern if possible
loved the explanation hoping for more such awesome explanations . thank you
wow!...really nice explanation...please make videos of other patterns like k-way merge and subsets
Thank you :D I've posted a video explaining the top k pattern, It's very similar to K-way merge
Such a smooth explanation! Actually helped me understand that kind of problems Thank you
albyy ❤❤
😍