Hunter X Hunter :)

consider freq map has values [1,2] and [2,1] and x=1

so nfreq will be same as [1,2] and [2,1] now when you are looping in freq , when 1 comes , it will inc the count of 2 in nfreq , but in freq, the count of 2 will remain same as it was previous.....so you just need to change freq to nfreq in that loop

can you provide some test cases?

i think we can solve this by binary search ,since for all the possible values of k ( greater than the minimum ) we can accomodate the bundles of money so we can see a monotonic graph which proves we can apply binary search.

ohh got it, i didn't focus on it

Can someone help me in Problem XOR And Multiply
when i used (1LL<<32), i got correct answer , but when i used that power function which calculates power in logn time , i got wrong answer. I think the TC of 2nd solution was sufficient to pass all the test cases

Correct Submission Wrong submission

approach for B ?

i think , this should help https://www.youtube.com/watch?v=meGcKZYxVe8&list=PLauivoElc3ghk5480uu-T5nkEUY6Tbm6V&index=4

because of s=s+to_string(), instread of this , you can use s+=to_string().

As a tester, i can confim this you will gonna be fool by problems :)

i read all of them,now i am sure , in next context i will reach expert :)

"good luck and have a good score"