what a simple way explanation didi,, thanx

good explaination😇 Radhe Radhe😀

12 Nov ka POTD ??

very nice expanation

great approach

What's the time and space complexity and their percentage among others

how you developed your logic skill.. i am trying hard but still lacking can you help me please

Please create videos in English, I am from Telugu I also understand English but not Hindi

at 9:20 why r u taking the ans =n+1 or 4 ?

Thankyou so much maam , Radhe radhe !

Radhe Radhe. thanx you for the solution. really very helpful.

aur voice bhi thoda tej kar dijiye mam

good explain mam....sath me thod concept bhi explain kr diya karo

Thank you di. solved today's problem of the day 😃

❤❤

Hii

🙇🙇

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)

You got a subscriber !

thankyou !! radhe radhe

hey! please reply me, In my problem the return type of method was INT and when i code same as u one test case was not passed and i see the difference in your code that is return type LONG. All the thing is here ( n = 6715154, x = 7193485 and expected 55012476815 and output -822098033). why the difference please..... tell.......... RADHE RADHE............

public long minEnd(int n,int x){ n--; long mask=x; for(long i=1;n>0;i<<=1){ if((i&x)==0){ mask|=(n&1)*i; n>>=1; } } return mask; tc=nlogn ==64 bits 0(1); sc=0(1); 🎉❤

thanx for the video . Radhe Radhe

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 .

Amazing Explaination ! you got a subscriber

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

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

feeling like a dumb.

Great explanation✌

mam you are doing great please also add DSA course in java

i think you girl lose your way i show you if you want ,

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!

nice explanation Radhe Radhe🤗🤗🤗

Nice

thanx for the solution Radhe Radhe

explain in english

thank you so much

just ezplain whole thing in english plz

nice explaination 👏

i<24 kro = hatao isko last 24bit tk hi jana hai isliye fayda hoga 8ms ka

thank you for the video. Radhe Radhe

Didi thanks i solved in bubble sort know i understand clearly thses optimal solution

*With this simple formula, you can find how many bits are required to represent a number. This is for Java, you will find something similar in other languages.* int noOfBits = (int)(Math.log(num)/Math.log(2)) + 1;

Straight forward But you should have explained - why you iterated 24 time i know that given constraint is n<10^7 (log 10^7 = 24 bits) but what if given n < 10^14

Radhe Radhe :)

thank you so much maam

as few of uuh are getting problem so i can explain a lil 10^7=10,000,000 in decimal. Binary Representation of 10,000,000: Converting 10,000,000 to binary, we get =100110001001011010000000 This binary representation has 24 bits. so we have to iterate each bit(from 1st bit till 24th) of respective element to check how many of them contain 1 at that particular bit position and then have to return the highest of them

hello mam, i really appreciate your efforts but this question i really did not understand, how you made combination and their value assumed i want to know how it is done, and how the answer is 4, could you please clear my doubt?