stack queue

A_Tale_of_Two_Stacks.py

class MyQueue(object):
    def __init__(self):
        self.stack1 = []
        self.stack2 = []
    
    def peek(self):
        if not self.stack2:
            while self.stack1:
                self.stack2.append(self.stack1.pop())
        return self.stack2[-1]
               
    def pop(self):
        if not self.stack2:
            while self.stack1:
                self.stack2.append(self.stack1.pop())
        return self.stack2.pop()
        
        
    def put(self, value):
        self.stack1.append(value)
        
        

queue = MyQueue()
t = int(input())
for line in range(t):
    values = map(int, input().split())
    values = list(values)
    if values[0] == 1:
        queue.put(values[1])        
    elif values[0] == 2:
        queue.pop()
    else:
        print(queue.peek())

Balanced_Brackets.py

#!/bin/python3

import math
import os
import random
import re
import sys

#
# Complete the 'isBalanced' function below.
#
# The function is expected to return a STRING.
# The function accepts STRING s as parameter.
#

def isBalanced(s):
    # Write your code here
    stack = []
    map = {
        ")" : "(",
        "}" : "{",
        "]" : "["
    }
    
    if len(s) % 2 == 1:
        return "NO"
    
    for item in s:
        if item == "(" or item == "{" or item == "[":
            stack.append(item)
        elif len(stack) == 0:
            return "NO"
        elif len(stack) and (stack.pop() != map[item]):
            return "NO"

        
    if len(stack) > 0:
        return "NO"
    else:
        return "YES"
        

if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    t = int(input().strip())

    for t_itr in range(t):
        s = input()

        result = isBalanced(s)

        fptr.write(result + '\n')

    fptr.close()