Mam, I was struggling to come up with an approach to solve the problem. I couldn’t think of a solution, but after watching your video, I understand it better. Thank you!
please continue solving these daily leetcode questions ......also I request you to make your 300-400 leetcode questions sheet with their video solutions by you in java ......as there is a lot of questions and study material in c++ but not in java ......and your explanation is crystal clear and easy to understand so I request you to do so ......as it will be very helpful for our placements
Intution :1) we need the smallest no from which AND operation provde x . 2) Thats mean we need to perform OR operation to keep intact the set bits . 3) But why need to perform the OR from justt greater no ,cuz from that it helps to get the extra set bits like 7-111 8-1000 in this case we get the first extra set bit ,these edge case is being perfomed by this OR operation with next no .
how to approach to the solution by our own mam....because after seeing the video I am knowing it...I am struggling to come up with the solution...please help me
![ทุกครั้งที่หลับตา (Lucid Dream) - AYLA's [ Official MV ]](http://i.ytimg.com/vi/4i1OBAQyv58/mqdefault.jpg)
thankyou !!
radhe radhe
You got a subscriber !
thanx for the video . Radhe Radhe
Glad it was helpful!
Mam, I was struggling to come up with an approach to solve the problem. I couldn’t think of a solution, but after watching your video, I understand it better. Thank you!
Glad I could help!
Amazing Explaination ! you got a subscriber
Glad you found it helpful!
Great explanation✌
Glad you liked it
please continue solving these daily leetcode questions ......also I request you to make your 300-400 leetcode questions sheet with their video solutions by you in java ......as there is a lot of questions and study material in c++ but not in java ......and your explanation is crystal clear and easy to understand so I request you to do so ......as it will be very helpful for our placements
Thanks for your request! I'll definitely keep making these daily LeetCode videos, and I'll think about creating a Java solution playlist.
🙇🙇
Intution :1) we need the smallest no from which AND operation provde x .
2) Thats mean we need to perform OR operation to keep intact the set bits .
3) But why need to perform the OR from justt greater no ,cuz from that it helps to get the extra set bits like 7-111 8-1000 in this case we get the first extra set bit ,these edge case is being perfomed by this OR operation with next no .
Great work!
mam you are doing great please also add DSA course in java
Thanks for the suggestion!
Your videos are good but you should try a different type of thumbnail with better font (don't mean to offend you or anything content is top notch)
Thanks for your suggestion, I will try to change it asap!
how to approach to the solution by our own mam....because after seeing the video I am knowing it...I am struggling to come up with the solution...please help me
Practice is key, keep working at it and you'll get better at coming up with solutions!
feeling like a dumb.
It's alright, keep practicing!
public long minEnd(int n,int x){
n--;
long mask=x;
for(long i=1;n>0;i=1;
}
}
return mask;
tc=nlogn ==64 bits 0(1);
sc=0(1);
🎉❤
if possible can anyone explain this solution also.. @algorithmsbyaditi
@heyRay81194
Explanation is if n=2,x=7,
I =1 1&7!=0 i=2,2&7!=0,i=4&7!=0,i=8&7==0;
7|=(n=1&1)=1*8;
7|8=15;
n>>1 n==0;
mask=15;
@@dayashankarlakhotia4943 🙇🏻
i think you girl lose your way i show you if you want ,