From 18c33edfb0c8b09ba04503af0acf0822f4995381 Mon Sep 17 00:00:00 2001
From: marina <138340846+bt3gl-cryptographer@users.noreply.github.com>
Date: Mon, 7 Aug 2023 18:06:56 -0700
Subject: [PATCH] Update and rename circular_queue_III.py to
 circular_queue_list.py

---
 ...cular_queue_III.py => circular_queue_list.py} | 16 +---------------
 1 file changed, 1 insertion(+), 15 deletions(-)
 rename queues/{circular_queue_III.py => circular_queue_list.py} (91%)

diff --git a/queues/circular_queue_III.py b/queues/circular_queue_list.py
similarity index 91%
rename from queues/circular_queue_III.py
rename to queues/circular_queue_list.py
index 599f326..a104470 100644
--- a/queues/circular_queue_III.py
+++ b/queues/circular_queue_list.py
@@ -1,7 +1,6 @@
 #!/usr/bin/env python3
 # -*- coding: utf-8 -*-
 # author: bt3gl
-# this is my favorite implementation <3
 
 
 class Node:
@@ -13,17 +12,14 @@ class Node:
 class CircularQueue:
 
     def __init__(self, k: int):
-      
         self.capacity = k
         self.count = 0
         self.head = None
         self.tail = None
         
     def enqueue(self, value: int) -> bool:
-
         if self.count == self.capacity:
             return False
-        
         if self.count == 0:
             self.head = Node(value)
             self.tail = self.head
@@ -31,40 +27,30 @@ class CircularQueue:
             new_node = Node(value)
             self.tail.next = new_node
             self.tail = new_node
-          
         self.count += 1
-      
         return True
 
     def dequeue(self) -> bool:
-
         if self.count == 0:
             return False
-          
         self.head = self.head.next
         self.count -= 1
-      
         return True
 
     def front(self) -> int:
-
         if self.count == 0:
             return -1
-          
+        
         return self.head.value
 
     def rear(self) -> int:
-
         if self.count == 0:
             return -1
-          
         return self.tail.value
     
     def is_empty(self) -> bool:
-
         return self.count == 0
 
     def is_full(self) -> bool:
-
         return self.count == self.capacity