in the queries update, you are sorting p, p+m does it also sort based on 2nd value? afaik, it will probably sort on the basis of count, but shouldn't we also sort it index wise?
i am not getting the code of c could someone explain me why we are taking the index-- just after taking the input how does this will help us to solve the porblem
He didnt mean for all 1 in original string He meant after pairing we are left with all 1s,eg 1011 then we can pair 01 to get 1 and rest are 1,1 so answer is 1 for your case,answer will be 11 yes
Thank you for your analysis.
Your videos are helping me a lot in building intuition.
Great work sir really appreciate your efforts ❤
God Bless this man for making this journey possible
❤️❤️
Explanation for E is more than great!
problem C : 15:43
in the queries update, you are sorting p, p+m
does it also sort based on 2nd value? afaik, it will probably sort on the basis of count, but shouldn't we also sort it index wise?
Nice explanation❤
Maybe ur code for G works cos of amortization?
i am not getting the code of c could someone explain me why we are taking the index-- just after taking the input how does this will help us to solve the porblem
How if all the numbers are 1 result is 1??
Result should be 11
"11111"=11×1×1×1=11
same doubt man
He didnt mean for all 1 in original string
He meant after pairing we are left with all 1s,eg 1011 then we can pair 01 to get 1 and rest are 1,1 so answer is 1
for your case,answer will be 11 yes
Noo you should make the 2 digits number first then do the operation
can smo tell the hack cases for B do while solution?
thanks brother
did the round become unrated and if yes why tf
I didn't understand that in queries update when a index appears twice then how are we going to deal with it.
it don't matter as we only care about what to put in that index once so you can take 1 1 2 4 as 1 2 4 then put values of chars from small to large
@@Misfit-nd3zk ok means we just had to sort the c string and then take unique values from the index array and put them inside the string s right?
Yes
You can think it like first placing some letter which are at the end of sorted string c and then for last time at the same index put the smallest
i took a hash set for ind and sorted c string then simply put the lowest char values.
your explanation for E is great