Implement a bounded bifocii data structure using an array and efficient enqueue and dequeue algorithms

Question

X · Accepted Answer

class Queue:
    def __init__(self):
        self.items = []

    def isEmpty(self):
        return self.items == []

    def enqueue(self, item):
        self.items.insert(0,item)

    def dequeue(self):
        return self.items.pop()

    def size(self):
        return len(self.items)


simple Queue?

Microsoft

Pregunta de entrevista de Microsoft

Respuesta de la entrevista

Empresas seguidas

Búsquedas de empleo