Inspiration

A daily challenge from GHW AI/ML

What it does

Simple wrapper for Python built-in list to simulate a queue data structure

How I built it

I used my knowledge of DSA to built it Code:

import typing

class MyQueue:
    def __init__(self):
        self.__arr = []

    def size(self) -> int:
        return len(self.__arr)

    def __len__(self):
        return len(self.__arr)

    def raw_list(self) -> list:
        return self.__arr

    def push(self, element) -> None:
        self.__arr.append(element)

    def pop(self) -> typing.Any:
        return self.__arr.pop(0)


if __name__ == "__main__":
    Q = MyQueue()
    for i in range(5):
        Q.push(i)
    print(f"First Q.pop() returned `{Q.pop()}`")  # prints 0
    print(f"Second Q.pop() returned `{Q.pop()}`")  # prints 1
    print("Press enter to exit.")
    input()

Built With

Share this project:

Updates