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 know this is a deque question but I tried to maximise efficiency of runtime by decreasing iterations, the code finds the smallest value and checks if travelling to either end is equivalent to its sorted counterpart
Piling Up!
You are viewing a single comment's thread. Return to all comments →
I know this is a deque question but I tried to maximise efficiency of runtime by decreasing iterations, the code finds the smallest value and checks if travelling to either end is equivalent to its sorted counterpart