3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K | Weekly Leetcode 380

[@trishulcurtis1810]

very intuitive! nice

[@janviarora3199]

Can you please explain how did you take the upper bound as 64*1e15?

[@harishankarkarthik3570]

I think the bruteforce solution has O(ulog(u)) time complexity, because binary representation is log(u) length.

[@codingmohan]

We are also iterating over every numbers from 1 to X right.

[@hemanthijjurouthu3677]

Awesome explanation sir

[@ECBvamsi]

Sir can you tell why the below code is not working i think this time complexity is lesser then your code if not give me any suggestions to modify the code int count=0; int ans=1; while(count

[@codingmohan]

Can you help understand the intuition of your solution - "Why you think the solution should work?". Also, in this kind of situations, the best thing is to run your code on a simple test case (maybe 8 bit number) and figure out a case where your code is giving incorrect result (you can compare it with any working solution). That way you can better understand if there is a flaw in the logic or your implementation itself. Further if there is a logical flaw, it will help you understand what you actually missed and you'll be able to retain that for a longer duration.

[@ECBvamsi]

@@codingmohan SIR LIKE I WAS COUNTING BITS UPTO LIMIT OF COUNT