Discussion on Day 18: Queues and Stacks Challenge

8 years ago+ 6 comments

You don't need pop(-1) or pop(0); instead, for the queue data structure, you should use insert(0,n) for the enqueue method. Check my codes.

class Solution:
    # Write your code here
    def __init__(self):
        self.stack = []
        self.queue = [] 
        
    def pushCharacter(self, ch):
        self.stack.append(ch)
        
    def enqueueCharacter(self, ch):
        self.queue.insert(0, ch)
        
    def popCharacter(self):
        return self.stack.pop()
        
    def dequeueCharacter(self):
        return self.queue.pop()

Cookie support is required to access HackerRank