Hi guys, I have not been well since yesterday evening. High fever and throat issue. Hence the video was delayed. I hope it helps. Thank you all for your love and support.❣❣❣
@espio33648 ай бұрын
Thank you for such an Insane Consistency, You're Amazing 🙏
@harshtiwari4168 ай бұрын
larry page real id se aao
@ugcwithaddi8 ай бұрын
Take care MIK
@dayashankarlakhotia49438 ай бұрын
take care you health
@pranjalpandey30778 ай бұрын
Take care bhaiya :)
@manimanohar_0018 ай бұрын
Bahiya bit manipulation pe bhi ek playlist bana do like recursion. 1 video per week is enough. 🙏🙏🙏🙏
@aadil42368 ай бұрын
Bhai pehli 7-8 min me hi samaj me aa gaya solution kya mast batate ho aap! mene khud hi solve karliya pura video dekehe bina. bot simple solution tha! Thank you!
@anuppatankar42948 ай бұрын
2nd approach was awesome 👍🏻
@amitchoraria57378 ай бұрын
Very well explained :) One of the better videos than all the other videos I have seen on this question. Thanks
@adityaparab43148 ай бұрын
The way you are being consistent even after being sick gives me so much inspiration to be disciplined and keep going. Thank you.
@aadil42368 ай бұрын
Take care of yourself brother the season is changing I was also sick a while ago. And Thank you for the explanation as always!.
@muhammadalikhanbaloch74758 ай бұрын
Thank you sir 😊
@arjunprasad10718 ай бұрын
Thanks for your explaination!! I tried explaining the first approach to myself by looking at other solutions but was unable to. Was waiting since since morning for your explainer. Wishing you a speedy recovery ;)
@wearevacationuncoverers8 ай бұрын
Hats off to your dedication. and take care get well soon.
@sapnokasahar30988 ай бұрын
I have tried from side. Then, I was waiting for your video for better understanding
@Ankitkumar-fz3kc8 ай бұрын
Thanks again for making this easy through your explanation ❤❤
@codestorywithMIK8 ай бұрын
😇❤️
@JoyAcharyatvl8 ай бұрын
Hore krishna. bhai you are just amazing. nice explanation. learned many things from this video.
@souravjoshi22938 ай бұрын
I was waiting for you only. Thanks a lot
@jeehub0418 ай бұрын
Nicely explained bhai❤
@sauravchandra108 ай бұрын
Get well soon ❤
@23cash868 ай бұрын
Thanks, waiting for bits series
@viditvaish73178 ай бұрын
as usual sir you are amazing and your explanation is fabulous you never ever disappoint us
@uvs_60328 ай бұрын
2nd solution is quite nice but i dont think i will ever come up with that in an interview 😅
@coderletscode8 ай бұрын
Get well soon!
@gauravbanerjee28988 ай бұрын
Thanks a lot bhaiya ❤❤ Hats of to your dedication making videos even when you are not well 🫡Get well soon 🙌
@tutuimam33818 ай бұрын
Thanks ❤❤❤❤
@Shivanai_h8 ай бұрын
Thanks, Mik for your hard work, please bring BIT Manipulation Playlist first
@ankitsahu23058 ай бұрын
Best explanation, Keep it up❤
@non-csesoftwaredeveloper48018 ай бұрын
Waiting for your video bro
@saketyadav11198 ай бұрын
hahaha i was waiting for this video from you, tho i already watched aryan mittal's video but i really like how you explain stuff so here again
@wearevacationuncoverers8 ай бұрын
Same. I watched Neetcode, Techdose and Aryan's video. couldn't completely get my doubts cleared. Then I always come to this channel and like always I could get the intuition during half of the video and coded it . Something is unique about him.
@umeshbisht10548 ай бұрын
Thanku bhaiya ❤
@thekindspill8 ай бұрын
finallyy 🥳. thanks a lot
@oqant04248 ай бұрын
I bow to u for teaching us new things every single day U are biggest inspiration to become a great coder ✨✨ Thanks from the bottom of my 💓💓 POTD DONE [21.2.24]✅✅
@EB-ot8uu8 ай бұрын
Why is always that my doubts are literally always cleared when I see your explanation. 😅
@bhuppidhamii8 ай бұрын
we want Bit Manipulation Playlist!!!
@theOmKumar8 ай бұрын
LCP approach 👌
@bhuppidhamii8 ай бұрын
LCP ?
@shatakshi318 ай бұрын
Bhaiyaaa please bit manipulation ki playlist bana dijiya like recursion your playlist is is verry useful
@newglobal20568 ай бұрын
Bhaiya pehle app lld Lao please and upp jaldi thik ho jao❤❤
@vikassingh64524 ай бұрын
in first approach time complexity is o(1) beacause maximum bit in a integer is 32 any number we shift 32 times it becomes zero
@EatCodeAndSleep8 ай бұрын
in first approach we r actually right shifting 32 bits at worst case right then tc will be o(32) only right we can call it as O(1) only instead
@codestorywithMIK8 ай бұрын
Perfect 👌
@Strawcontamination8 ай бұрын
Please include backtracking and trees concepts and questions
@faizanalam88238 ай бұрын
please share questions of similar pattern!!
@codeandtalk68 ай бұрын
❤❤❤
@RajChauhan-iu3dc8 ай бұрын
Bro can you tell me the name of application on which you use to explain the problems??
@dayashankarlakhotia49438 ай бұрын
Recursion best use by your guidance. class Tree{ public void serialize (Node root,ArrayListA){ if(root==null){ A.add(-1); return; } A.add(root.data); serialize(root.left,A); serialize(root.right,A); } public Node deSerialize(ArrayListA){ if(A.size()==0) return null; int a=A.remove(0); if(a==-1) return null; Node root=new Node(a); root.left =deSerialize(A); root.right=deSerialize(A); return root; } } 🎉❤
@amansaurabh45528 ай бұрын
bhaiya please make video on 289 Game of Life and 1499 Max Value of equation
@swarnadeepsaha44558 ай бұрын
Yes mik thanks a lot for system design , lld, oops
@bhuppidhamii8 ай бұрын
What is the TC of approach 2?
@sauravfarkade70328 ай бұрын
cout
@piyushmaurya80828 ай бұрын
Bhaiya aap kon si company me ho ?
@ru450988 ай бұрын
In your dp series ,the climbing stairs and first house robber one is showing only of 6 second..please fix the issue
@ugcwithaddi8 ай бұрын
Check the description of those 6 second videos. It contains the link to the full video in a different playlist. I completed few days ago.