[CSES][Sorting and Searching] Collecting Numbers II 

Your series have been really helpful. Thank you !!

plot twist: he is not explaining the problem but he is actually solving it

amazing series!

thank you

Thanks

Great Explanation and Great video hats off to you , it is really helpful

Why does my solution not work? I basically used the same code as in the collecting numbers problem, but for each query I check whether the first integer A's position was ok in relation to A - 1. Then I do the same after swapping. (I do this for both numbers). If it was ok before swapping and not ok after swapping, increment 1 to the answer. If it was not ok before swapping but it now is, decrement 1. I dont understand why this doesnt work

Thanks , i listened to your explantion and coded it myself :)

Can you link a copy of the code for this? I'm trying to troubleshoot my code and it would be helpful to debug using working code to compare

Woow man osm ❤

Thankyou bro. U Just made to start coding ☺️☺️☺️

Great explanation. Thank you

just subscribe to him! really helpful content:)

what a great explanation, understood everything. thank you so much

key observation : concerned only with consecutive ordered pairs

thank you very much

Thanks a lot!

Nice!

n1

Can u provide code link