### iamskp's blog

By iamskp, history, 3 years ago,

I am doing this problem. Can someone please tell me why i am getting tle verdict. My submission is in python. My submission : https://codeforces.com/contest/1283/submission/88064624

• -1

| Write comment?
 » 3 years ago, # |   0 Removing from index $i$ of a list should be $O(n - i)$, so repeatedly removing from the beginning — middle of the list will cause TLE.
•  » » 3 years ago, # ^ | ← Rev. 3 →   0 I was removing the elements from a set. Shouldn't it be O(1) operation. And in the last part,i am popping the element from the list treating it like a double ended queue.So it should also take O(1) time. Am i missing something?
•  » » » 3 years ago, # ^ |   0 I think popping the last element is $O(1)$, but popping the first is $O(n)$: https://stackoverflow.com/questions/195625/what-is-the-time-complexity-of-popping-elements-from-list-in-python/46136638#:~:text=Yes%2C%20it%20is%20O(1,list%20has%20to%20be%20shifted).&text=With%20an%20argument%20to%20pop,case%20time%20complexity%20O(k)Use a deque to do both operations in $O(1)$.