Bitwise AND of Numbers Range | 2 Approaches | Dry Run | Leetcode 201

[@codestorywithMIK]

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.❣❣❣

[@espio3364]

Thank you for such an Insane Consistency, You're Amazing 🙏

[@harshtiwari416]

larry page real id se aao

[@ugcwithaddi]

Take care MIK

[@dayashankarlakhotia4943]

take care you health

[@pranjalpandey3077]

Take care bhaiya :)

[@manimanohar_001]

Bahiya bit manipulation pe bhi ek playlist bana do like recursion. 1 video per week is enough. 🙏🙏🙏🙏

[@aadil4236]

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!

[@amitchoraria5737]

Very well explained :) One of the better videos than all the other videos I have seen on this question. Thanks

[@anuppatankar4294]

2nd approach was awesome 👍🏻

[@muhammadalikhanbaloch7475]

Thank you sir 😊

[@aadil4236]

Take care of yourself brother the season is changing I was also sick a while ago. And Thank you for the explanation as always!.

[@adityaparab4314]

The way you are being consistent even after being sick gives me so much inspiration to be disciplined and keep going. Thank you.

[@arjunprasad1071]

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 ;)

[@sapnokasahar3098]

I have tried from side.
Then, I was waiting for your video for better understanding

[@wearevacationuncoverers]

Hats off to your dedication. and take care get well soon.

[@jeehub041]

Nicely explained bhai❤

[@Ankitkumar-fz3kc]

Thanks again for making this easy through your explanation ❤❤

[@codestorywithMIK]

😇❤️

[@JoyAcharyatvl]

Hore krishna. bhai you are just amazing. nice explanation. learned many things from this video.

[@souravjoshi2293]

I was waiting for you only. Thanks a lot

[@sauravchandra10]

Get well soon ❤

[@coderletscode]

Get well soon!

[@tutuimam3381]

Thanks ❤❤❤❤

[@EatCodeAndSleep]

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

[@codestorywithMIK]

Perfect 👌

[@viditvaish7317]

as usual sir you are amazing and your explanation is fabulous you never ever disappoint us

[@gauravbanerjee2898]

Thanks a lot bhaiya ❤❤ Hats of to your dedication making videos even when you are not well 🫡Get well soon 🙌

[@23cash86]

Thanks, waiting for bits series

[@ankitsahu2305]

Best explanation, Keep it up❤

[@non-csesoftwaredeveloper4801]

Waiting for your video bro

[@saketyadav1119]

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

[@wearevacationuncoverers]

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.

[@faizanalam8823]

please share questions of similar pattern!!

[@uvs_6032]

2nd solution is quite nice but i dont think i will ever come up with that in an interview 😅

[@Shivanai_h]

Thanks, Mik for your hard work, please bring BIT Manipulation Playlist first

[@oqant0424]

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]✅✅

[@umeshbisht1054]

Thanku bhaiya ❤

[@vikassingh6452]

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

[@shatakshi31]

Bhaiyaaa please bit manipulation ki playlist bana dijiya like recursion
your playlist is is verry useful

[@RajChauhan-iu3dc]

Bro can you tell me the name of application on which you use to explain the problems??

[@EB-ot8uu]

Why is always that my doubts are literally always cleared when I see your explanation. 😅

[@Strawcontamination]

Please include backtracking and trees concepts and questions

[@theOmKumar]

LCP approach 👌

[@bhuppidhamii]

LCP ?

[@thekindspill]

finallyy 🥳. thanks a lot

[@bhuppidhamii]

What is the TC of approach 2?

[@dayashankarlakhotia4943]

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;
}
}
🎉❤

[@bhuppidhamii]

we want Bit Manipulation Playlist!!!

[@amansaurabh4552]

bhaiya please make video on 289 Game of Life and 1499 Max Value of equation

[@newglobal2056]

Bhaiya pehle app lld Lao please and upp jaldi thik ho jao❤❤

[@ru45098]

In your dp series ,the climbing stairs and first house robber one is showing only of 6 second..please fix the issue

[@ugcwithaddi]

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.

[@ru45098]

thanks@@ugcwithaddi

[@sauravfarkade7032]

cout

[@piyushmaurya8082]

Bhaiya aap kon si company me ho ?

[@swarnadeepsaha4455]

Yes mik thanks a lot for system design , lld, oops

[@codeandtalk6]

❤❤❤

[@naikajsevak6090]

did u solved this problem first time ??