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.
- Prepare
- Python
- Collections
- Piling Up!
- Discussions
Piling Up!
Piling Up!
Sort by
recency
|
890 Discussions
|
Please Login in order to post a comment
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
Could someone help take a look why this fails?