https://school.programmers.co.kr/learn/courses/30/lessons/42587
from collections import deque
def solution(priorities, location):
dq = deque(priorities)
cnt = 0
while dq:
if max(dq) != dq[0]:
dq.append(dq.popleft())
elif max(dq) == dq[0] and location == 0:
return cnt + 1
else:
dq.popleft()
cnt += 1
if location > 0:
location -= 1
else:
location = len(dq) - 1
#deque #popleft