In** problem E** of yesterday's round, I misread the question and thought of a completely different problem the whole time.↵
But this problem might also be interesting for some of you guys. So, here goes the modification:-↵
Instead of **swapping any two elements**, you can **swap only two adjacent elements** and the constraint on ** m is <=m**<=**n**.↵
↵
I can share my idea and code also for this problem which I think works. Meanwhile, if any of you guys know any links where we can submit this problem, please share it.↵
↵
Thanks for reading.
But this problem might also be interesting for some of you guys. So, here goes the modification:-↵
Instead of **swapping any two elements**, you can **swap only two adjacent elements** and the constraint on **
↵
I can share my idea and code also for this problem which I think works. Meanwhile, if any of you guys know any links where we can submit this problem, please share it.↵
↵
Thanks for reading.