Revision 1 (Amaras)

Author: Michae1CC

CONTRIBUTORS.md

@@ -64,3 +64,4 @@ This file lists everyone, who contributed to this repo and wanted to show up her
 - K. Shudipto Amin
 - Peanutbutter_Warrior
 - Thijs Raymakers 
+- Michael Ciccotosto-Camp

contents/stacks_and_queues/code/python/queue.py

@@ -2,40 +2,14 @@
 
 __author__ = "Michael Ciccotosto-Camp"
 
-import abc
-
 from collections.abc import Sized
 from typing import TypeVar, Generic
 
 
 T = TypeVar("T")
 
 
-class IQueue(Generic[T], Sized, abc.ABC):
-    @abc.abstractmethod
-    def dequeue(self) -> T:
-        """
-        Removes the first element from the queue and returns it.
-        """
-        ...
-
-    @abc.abstractmethod
-    def enqueue(self, element: T) -> int:
-        """
-        Add an element at the end of the queue and returns the
-        new size of the queue.
-        """
-        ...
-
-    @abc.abstractmethod
-    def front(self) -> T:
-        """
-        Returns the first element in the queue without removing it.
-        """
-        ...
-
-
-class Queue(IQueue[T]):
+class Queue(Generic[T], Sized):
     def __init__(self) -> None:
         self.__list: list[T] = list()
 

contents/stacks_and_queues/code/python/Stack.py renamed to contents/stacks_and_queues/code/python/stack.py

@@ -2,40 +2,14 @@
 
 __author__ = "Michael Ciccotosto-Camp"
 
-import abc
-
 from collections.abc import Sized
 from typing import TypeVar, Generic
 
 
 T = TypeVar("T")
 
 
-class IStack(Generic[T], Sized, abc.ABC):
-    @abc.abstractmethod
-    def pop(self) -> T:
-        """
-        Removes the last element from the stack and returns it.
-        """
-        ...
-
-    @abc.abstractmethod
-    def push(self, element: T) -> int:
-        """
-        Adds an element to the end of the stack and returns the
-        new length of the stack.
-        """
-        ...
-
-    @abc.abstractmethod
-    def top(self) -> T:
-        """
-        Returns the first element of the stack.
-        """
-        ...
-
-
-class Stack(IStack[T]):
+class Stack(Generic[T], Sized):
     def __init__(self) -> None:
         self.__list: list[T] = []
 

contents/stacks_and_queues/stacks_and_queues.md

@@ -2,9 +2,9 @@
 
 Stacks and Queues are two sides of the same coin in computer science. They are both simple data structures that hold multiple elements, but allow you to use a single element at a time. The biggest difference between the two structures is the order in which you can access the elements in the data structure.
 
-In _stacks_, data follows _Last In, First Out_ (LIFO), which basically means that whichever element you put in last will be the first element you take out. It acts exactly like a stack in real life. If you put a book on a stack of other books, the first book you will look at when sifting through the stack will be the book you just put on the stack.
+In *stacks*, data follows *Last In, First Out* (LIFO), which basically means that whichever element you put in last will be the first element you take out. It acts exactly like a stack in real life. If you put a book on a stack of other books, the first book you will look at when sifting through the stack will be the book you just put on the stack.
 
-In _Queues_, data follows _First In, First Out_ (FIFO), which means that whichever element you put in first will be the first element you take out. Imagine a queue of people. It would be unfair if the first person in line for groceries were not the first person to receive attention once the attendant finally shows up.
+In *Queues*, data follows *First In, First Out* (FIFO), which means that whichever element you put in first will be the first element you take out. Imagine a queue of people. It would be unfair if the first person in line for groceries were not the first person to receive attention once the attendant finally shows up.
 
 For the most part, though, queues and stacks are treated the same way. There must be a way to: