Collections.deque()

Sort by

recency

|

658 Discussions

|

  • + 0 comments
    from collections import deque
    n=int(input())
    d=deque()
    for _ in range(n):
        y=input().split()
        if(y[0]=="append"):
            d.append(y[1])
        elif(y[0]=="appendleft"):
            d.appendleft(y[1])
        elif(y[0]=="pop"):
            d.pop()
        elif(y[0]=="popleft"):
            d.popleft()
    print(*d,end=" ")
    
  • + 0 comments
    from collections import deque
    d=deque()
    for _ in range(int(input())):
        n=input().split()
        if n[0]=="append":
            d.append(int(n[-1]))
        elif n[0]=="appendleft":
            d.appendleft(int(n[-1]))
        elif n[0]=="pop":
            d.pop()
        elif n[0]=="popleft":
            d.popleft()
    print(" ".join(map(str, list(d))))
    
  • + 0 comments
    from collections import deque
    d= deque()
    N = int(input())
    
    for inp in range(N):
        operation = input().split()
        if len(operation) == 1:
            getattr(d, operation[0])()
        else:
            getattr(d, operation[0])(operation[1])
    
    print(" ".join(d))
    
        
    
  • + 0 comments
    # Enter your code here. Read input from STDIN. Print output to STDOUT
    from collections import deque
    d = deque()
    for _ in range(int(input())):
        function = input().split()
        match function[0]:
            case "append":
                d.append(int(function[1]))
            case "pop":
                d.pop()
            case "popleft":
                d.popleft()
            case "appendleft":
                d.appendleft(int(function[1]))
    print (" ".join(map(str,d)))
    
    
    
    
    
    
    
  • + 0 comments

    Here is HackerRank Collections.deque() in python solution - https://programmingoneonone.com/hackerrank-collections-deque-solution-in-python.html