Practice>Python>Collections>Piling Up!

hackerrank.com

Piling Up!

Problem link : https://www.hackerrank.com/challenges/piling-up/problem

Difficulty : Medium

Tip

• Simplify the rule of problem
• If we assume s[] is a all of sideLength, s[0] or s[-1] should be biggest number in s
• This is a key to solve problem
• To access easily to head and tail, deque is good to use

Solution

from collections import deque T = int(input()) def stack(n , s): for max_in_q in reversed(sorted(q)): if max_in_q == q[0]: q.popleft() elif max_in_q == q[-1]: q.pop() else: return 'No' return 'Yes' for _ in range(T): n = int(input()) s = list(map(int, input().split(' '))) q = deque(s) #print(s) r = stack(len(s), q) print(r)