Thank you for subscribing! I am sure the content will be valuable to you :)

Thank you! Sure, I will keep this in mind 👍. Meanwhile, if you have any specific question, you can drop that in the discord community.

Try watching the video portion again, there is code link attached in the description having detailed explanation in comments as well.

Thank you 😊

Glad it helped! 👍

Yeah! He really is humble!

Good Luck 🤞

Adobe is famous for asking anything in it's interviews. Well, It was a fun one to solve!

Thanks bro!! ❤️

💪💯. ❤ ❤ ❤

Thanks a lot for your feedback! 😊 Don’t worry, I’ll keep my coding videos in English. Totally understand the concern about language-it’s great to hear from international fans like you. 🙌

Glad it was helpful! 😊

Okay! I'll check and get back to you soon. Thanks :)

Glad it was helpful!

Thank you for your question! I sometimes let these mistakes happen deliberately because they are the most common errors people make while coding. My main aim is to help viewers gain a good understanding of the algorithm. To avoid mistakes in your code, I recommend dry running your pseudo-code before converting it into your chosen programming language. I follow this approach during coding interviews. PS: cracking MAANG interviews becomes easier if you have a strong hold on recursion-it’s a game-changer!

@@CodeHarmonyLab ok understood, thanks!

Thanks for watching!

Thank you!

I've been busy relocating to a new city and settling into my new job. Glad to see your comment as well! 😊

Thanks a lot ! Glad you liked.

Thanks :)

Thanks bro:) recently changing my job and location! So some days got skipped !

@@CodeHarmonyLab No worries!! Congratulations on the new job

@@rsKayiira Thanks bro :)

@@rsKayiira Thanks a lot bro :)

Thanks again!

Totally! Getting good at solving problems takes practice. Start by mastering the basics, then keep practicing. There’s no quick fix, but having a clear roadmap helps. Keep at it, and you’ll get better!

@@CodeHarmonyLab so any way or roadmap for revsing already completed topics , algo or questions ?

@@nidhimishra2436 One effective way to revise is by taking mock interviews. Also, try solving problems on paper, using diagrams if needed. This hands-on approach can really strengthen what you've learned and help you remember it better. Give it a try and see how it works for you! All the Best :)

@@CodeHarmonyLab ok tysmm I will try to do "revise is by taking mock interviews" yess I always solve questions on Paper

My pleasure 😇

Thanks :)

Right, here it’s O(1) for evey N elements. N * O(1)

Oh okay@@downtowngedi

Glad it was helpful!

Thanks :) More to come!

You’re welcome! Have you checked out the video I uploaded in DP playlist! #5th video of the DP study plan.

@@CodeHarmonyLab yes I saw the notification. Very excited to watch it thank you

Thank you for your continued support! Your comments always motivate me, even during busy times when recording content feels challenging.

This shows that n is divisible by 2 not the power of 2.

Thank you! :)

You're welcome!

Thanks for letting me know, I've updated the code accordingly.

You are welcome!

Oh, I just realised it was exported in low quality. Thanks for letting me know

Thank you so much for your kind words! I'm thrilled that you found the explanation helpful. Your encouragement means a lot to me. I'll do my best to continue with the Dynamic Programming series, and I hope it continues to be beneficial for you. Let's stay motivated together! 🚀📈

@@CodeHarmonyLab Yes I will be here!! Thank you so much!!