We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I tried pop (O(N)), deque (time to change list to deque and maybe change back), del(O(N)), none of them can pass 11, 12, 13.
Finally, by this hint, get rid of array manipulation (pure pointer changing) get all tests passed.
Thanks!
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Merge Sort: Counting Inversions
You are viewing a single comment's thread. Return to all comments →
I tried pop (O(N)), deque (time to change list to deque and maybe change back), del(O(N)), none of them can pass 11, 12, 13. Finally, by this hint, get rid of array manipulation (pure pointer changing) get all tests passed. Thanks!