From c756b213f8ec640a504f6c2ba8902836103130ec Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Fri, 28 Feb 2020 22:46:05 -0800
Subject: [PATCH 01/86] Created 1st Queues Slide

Created 1st Queues Slide
---
 Leetcode Workshops/Week 1/Queues(1).md | 15 +++++++++++++++
 1 file changed, 15 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Queues(1).md

diff --git a/Leetcode Workshops/Week 1/Queues(1).md b/Leetcode Workshops/Week 1/Queues(1).md
new file mode 100644
index 0000000..2165f73
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Queues(1).md	
@@ -0,0 +1,15 @@
+### Type: Title of Topic (Word Term #1, Word Term #2, etc...) ###
+
+### Title: What's a Queue? ###
+
+### Content:
+
+-Queues are data structures that removes the first element that was added into a list.
+
+-An example could be you wating at a long line at In-N-Out and the car that was there the earliest gets served first.
+
+![](https://coyotechronicle.net/wp-content/uploads/2012/04/IMG_0018-150x112.jpg)
+
+-Queues are implimented through adding elements to the rear of the queue and deleting elements at the front of the Queue.
+
+-This technique is known as FIFO (First in First out).

From c9f4f3e038104cb3814b559bcfccba1966b61ec8 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Fri, 28 Feb 2020 23:20:46 -0800
Subject: [PATCH 02/86] Updated Card

Updated Card
---
 Leetcode Workshops/Week 1/Queues(1).md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Leetcode Workshops/Week 1/Queues(1).md b/Leetcode Workshops/Week 1/Queues(1).md
index 2165f73..e952543 100644
--- a/Leetcode Workshops/Week 1/Queues(1).md	
+++ b/Leetcode Workshops/Week 1/Queues(1).md	
@@ -1,4 +1,4 @@
-### Type: Title of Topic (Word Term #1, Word Term #2, etc...) ###
+### Type: Text + Image ###
 
 ### Title: What's a Queue? ###
 

From 07da78cbcf27046aa8f5505003afc495f8e39310 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Fri, 28 Feb 2020 23:41:02 -0800
Subject: [PATCH 03/86] Created Queues(2).md

Created Queues(2).md
---
 Leetcode Workshops/Week 1/Queues(2).md | 39 ++++++++++++++++++++++++++
 1 file changed, 39 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Queues(2).md

diff --git a/Leetcode Workshops/Week 1/Queues(2).md b/Leetcode Workshops/Week 1/Queues(2).md
new file mode 100644
index 0000000..f377e8a
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Queues(2).md	
@@ -0,0 +1,39 @@
+### Type of Card: Code left/right ###
+
+### Title: Implementing a Queue ###
+
+- We're going to make a Queue class to show how the Queue itself works.
+
+-enqueue() adds elements to the rear of the queue.
+
+-dequeue() deletes elements from the front of the queue.
+
+-size() looks at the current size that the Queue has.
+
+-printQueue() prints out the current elements that are inside the queue
+
+```python
+
+class Queue:
+    #Constructor creates a list
+    def __init__(self):
+       self.queue=[]
+
+    #Adding elements to queue
+    def enqueue(self,data):
+        self.queue.insert(0,data)
+        return True
+
+    #Removing the last element from the queue
+    def dequeue(self):
+        return self.queue.pop()
+
+    #Getting the size of the queue
+    def size(self):
+        return len(self.queue)
+
+    #printing the elements of the queue
+    def printQueue(self):
+        return self.queue
+        
+ ```

From 6e0438310f1e15ca06eef673e7ba5ff83ac25f78 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Fri, 28 Feb 2020 23:41:35 -0800
Subject: [PATCH 04/86] Updated

Updated
---
 Leetcode Workshops/Week 1/Queues(1).md | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Leetcode Workshops/Week 1/Queues(1).md b/Leetcode Workshops/Week 1/Queues(1).md
index e952543..3de8b1f 100644
--- a/Leetcode Workshops/Week 1/Queues(1).md	
+++ b/Leetcode Workshops/Week 1/Queues(1).md	
@@ -4,12 +4,12 @@
 
 ### Content:
 
--Queues are data structures that removes the first element that was added into a list.
+- Queues are data structures that removes the first element that was added into a list.
 
--An example could be you wating at a long line at In-N-Out and the car that was there the earliest gets served first.
+- An example could be you wating at a long line at In-N-Out and the car that was there the earliest gets served first.
 
 ![](https://coyotechronicle.net/wp-content/uploads/2012/04/IMG_0018-150x112.jpg)
 
--Queues are implimented through adding elements to the rear of the queue and deleting elements at the front of the Queue.
+- Queues are implimented through adding elements to the rear of the queue and deleting elements at the front of the Queue.
 
--This technique is known as FIFO (First in First out).
+- This technique is known as FIFO (First in First out).

From 68d9f6082e0069e7814c4575d53b50011af93186 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Fri, 28 Feb 2020 23:41:45 -0800
Subject: [PATCH 05/86] Updated

Updated

From b8a3eea437fd69f155288e0f217d33e2fc5a04ec Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Fri, 28 Feb 2020 23:42:30 -0800
Subject: [PATCH 06/86] Updated

Updated
---
 Leetcode Workshops/Week 1/Queues(2).md | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Leetcode Workshops/Week 1/Queues(2).md b/Leetcode Workshops/Week 1/Queues(2).md
index f377e8a..e3b95ed 100644
--- a/Leetcode Workshops/Week 1/Queues(2).md	
+++ b/Leetcode Workshops/Week 1/Queues(2).md	
@@ -4,13 +4,13 @@
 
 - We're going to make a Queue class to show how the Queue itself works.
 
--enqueue() adds elements to the rear of the queue.
+- enqueue() adds elements to the rear of the queue.
 
--dequeue() deletes elements from the front of the queue.
+- dequeue() deletes elements from the front of the queue.
 
--size() looks at the current size that the Queue has.
+- size() looks at the current size that the Queue has.
 
--printQueue() prints out the current elements that are inside the queue
+- printQueue() prints out the current elements that are inside the queue
 
 ```python
 

From e9096e00a662ec698aaea173cd34b19252557963 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Sat, 29 Feb 2020 00:01:26 -0800
Subject: [PATCH 07/86] Create Queue(3).md

Create Queue(3).md
---
 Leetcode Workshops/Week 1/Queues(3).md | 44 ++++++++++++++++++++++++++
 1 file changed, 44 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Queues(3).md

diff --git a/Leetcode Workshops/Week 1/Queues(3).md b/Leetcode Workshops/Week 1/Queues(3).md
new file mode 100644
index 0000000..af325ae
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Queues(3).md	
@@ -0,0 +1,44 @@
+### Type: Code Steps Large ###
+
+### Title: What's a Deque? ###
+
+- A deque (or a double ended queue) is a data structure that removes and adds elements from either the front or the rear of a queue.
+
+- We're going to show you an example on how to implement a deque.
+
+1. Import the deque library.
+
+```python
+from collections import deque
+```
+
+2. Create your queue of elements while calling the deque function.
+
+```python
+# Creating a Queue
+queue = deque([1,5,8,9])
+```
+
+3. Append elements towards the rear of the queue.
+
+```python
+# Enqueuing elements to the Queue
+queue.append(7) #[1,5,8,9,7]
+queue.append(0) #[1,5,8,9,7,0]
+```
+
+4. This is where you can implement the deque() properly when you dequeuing elements. For deque, you would use the popleft() function
+   to delete elements in the front of the list (the version of deleting elements from the rear is popright()).
+   
+```python
+# Dequeuing elements from the Queue
+queue.popleft() #[5,8,9,7,0]
+queue.popleft() #[8,7,9,0]
+```
+
+5. You can call the print() function to check what elements are still in the queue.
+
+```python
+#Printing the elements of the Queue
+print(queue)
+```

From b0d00be0a445503f49a24dcf2b0215f6b1487d8f Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Sat, 29 Feb 2020 00:37:36 -0800
Subject: [PATCH 08/86] Created Queues(4).md

Created Queues(4).md
---
 Leetcode Workshops/Week 1/Queues(4).md | 37 ++++++++++++++++++++++++++
 1 file changed, 37 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Queues(4).md

diff --git a/Leetcode Workshops/Week 1/Queues(4).md b/Leetcode Workshops/Week 1/Queues(4).md
new file mode 100644
index 0000000..a1cf57d
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Queues(4).md	
@@ -0,0 +1,37 @@
+### Type: Code Steps Large ###
+
+### Title: A Real-life Example of a Queue ###
+
+- You're probably thinking, "Learning about queues is cool and all, but when will I ever apply this in my life?"
+
+- Well today's your lucky day!
+
+- Let's say that you're boarding a plane and you're fighting to get the first front seats of the plane.
+
+1. Let's say that the total amount of passengers is 50 people. Let's add each passenger in the plane using the enqueue() call
+   to fill up the number of spots available.
+   
+```python
+passengers = 50 #Total of the current 50 passengers on the plane
+boardingPlane = Queue()
+int(passengers) = 50
+
+for x in range(passengers):
+	boardingPlane.enqueue(x)
+  
+print(boardingPlane.size()) #result prints a size of 50
+```
+
+2. Now you're plane arrived at the Sacarmento airport and the first 30 passengers hopped off the plane while the last 20 waited
+   in the back because they're going to catch a different flight right after the plane has landed. We would now remove each of the 
+   30 passengers in order using the dequeue() call.
+   
+```python
+frontPassengers = 30 #1st 30 passengers that left the plane
+int frontPassengers = 30
+
+for x in range(frontPassengers):
+	boardingPlane.dequeue(x)
+
+print(boardingPlane.size()) #result prints a size of 20
+```

From 0cbeefcdb145d735a624a98b2540be6a7d73b1b1 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Sat, 29 Feb 2020 21:41:07 -0800
Subject: [PATCH 09/86] Created Stacks(1).md

Created Stacks(1).md
---
 Leetcode Workshops/Week 1/Stacks(1).md | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Stacks(1).md

diff --git a/Leetcode Workshops/Week 1/Stacks(1).md b/Leetcode Workshops/Week 1/Stacks(1).md
new file mode 100644
index 0000000..ad35189
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Stacks(1).md	
@@ -0,0 +1,25 @@
+### Type: Text + Image ###
+
+### Title: What's a Stack? ###
+
+- A stack is a data structure that adds elements to the front of the list.
+
+- How this data structure works is that earliest elements that are added into the stack will be on the bottom of the stack
+  and the most recent element that is on the stack will get removed first.
+  
+- This process is called LIFO (Last in, Last out).
+
+- An example can be a stack of books. Say that you have a huge stack of books at the library and you want to access your Calculus
+  textbook that's below your Physics, Circuts, and Chemistry textbooks.
+  
+- This is where you get to see the wonderful implementation of using a stack.
+
+- You would remove the most recent book that's on top of your stack (this is what we call popping an item into a stack) in order until
+  you can access your textbook.
+  
+- Congratulations! You can now work on those wonderful triple integrals that you have to do for your homework :`)
+
+- After finishing your homework, you can put your textbooks back on top of your calculus textboom (this is what we call pushing an
+  an item into a stack).
+  
+  ![](https://ya-webdesign.com/transparent250_/stack-of-clipart-tall-2.png)

From 8fe930b1b269a8276245c080795042f273e022a7 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Sat, 29 Feb 2020 21:41:56 -0800
Subject: [PATCH 10/86] Spelling Error

Spelling Error
---
 Leetcode Workshops/Week 1/Stacks(1).md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Leetcode Workshops/Week 1/Stacks(1).md b/Leetcode Workshops/Week 1/Stacks(1).md
index ad35189..fb1c79f 100644
--- a/Leetcode Workshops/Week 1/Stacks(1).md	
+++ b/Leetcode Workshops/Week 1/Stacks(1).md	
@@ -19,7 +19,7 @@
   
 - Congratulations! You can now work on those wonderful triple integrals that you have to do for your homework :`)
 
-- After finishing your homework, you can put your textbooks back on top of your calculus textboom (this is what we call pushing an
+- After finishing your homework, you can put your textbooks back on top of your calculus textbook (this is what we call pushing an
   an item into a stack).
   
   ![](https://ya-webdesign.com/transparent250_/stack-of-clipart-tall-2.png)

From 5b827b889751fe62764aafe89034bd47379e2df3 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Sat, 29 Feb 2020 22:08:02 -0800
Subject: [PATCH 11/86] Created Stacks(2).md

Created Stacks(2).md
---
 Leetcode Workshops/Week 1/Stacks(2).md | 49 ++++++++++++++++++++++++++
 1 file changed, 49 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Stacks(2).md

diff --git a/Leetcode Workshops/Week 1/Stacks(2).md b/Leetcode Workshops/Week 1/Stacks(2).md
new file mode 100644
index 0000000..438c498
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Stacks(2).md	
@@ -0,0 +1,49 @@
+### Type: Code steps large ###
+
+### Title: Implementing a Stack ###
+
+- Now that you have seen an example of what a stack is, let's put this knowledge into practice.
+
+- Before we get into the code, we should go over how each function in a stack works.
+
+- push() adds elements to the front of the stack (stacking items on top) and pop() remeoves the latest elements that are on top of the
+  stack.
+  
+- Now that you know these basics, let's make our stack class.
+
+1. The 1st step is to intialize our stack class with stack() being an empty list.
+
+```python
+class Stack:
+
+    #Constructor creates a list
+    def __init__(self):
+        self.stack = list()
+```
+
+2. The 2nd step is to create a push() function that adds elements to the stack.
+
+```python
+  #Adding elements to stack
+    def push(self,data):
+        self.stack.append(data)
+        return True
+```
+
+3. The 3rd step is to create a pop() function that removes elements from the stack.
+
+```python
+  #Removing last element from the stack
+    def pop(self):
+        if len(self.stack)<=0:
+            return ("Stack Empty!")
+        return self.stack.pop()
+```
+
+4. The final step is to create a size() function that returns our current size of the stack.
+
+```python
+#Getting the size of the stack
+    def size(self):
+        return len(self.stack)
+````

From 475dcfcc1f2f0cc3cc96a73e1ea8cf861e8c6dba Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Sat, 29 Feb 2020 22:25:53 -0800
Subject: [PATCH 12/86] Created Stacks(3).md

Created Stacks(3).md
---
 Leetcode Workshops/Week 1/Stacks(3).md | 82 ++++++++++++++++++++++++++
 1 file changed, 82 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Stacks(3).md

diff --git a/Leetcode Workshops/Week 1/Stacks(3).md b/Leetcode Workshops/Week 1/Stacks(3).md
new file mode 100644
index 0000000..f35cb82
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Stacks(3).md	
@@ -0,0 +1,82 @@
+### Type: Code Steps Large ###
+
+### Title: Testing out your Stack Class ###
+
+- If you're curious on testing out your stack class, here's an example of how to do it.
+
+1. Initialize your stack class to a stack variable that you're creating.
+
+```python
+myStack = Stack()
+```
+
+2. Add elements to your stack through calling the push() function.
+
+```python
+#The process of implimenting push() call for stack
+myStack = Stack()
+print(myStack.push(5)) #prints whether the operation "push" successes
+print(myStack.stack)   #print the stack(left is bottom of the stack,right is the top of stack)
+print(myStack.push(6)) 
+print(myStack.stack)
+print(myStack.push(9)) 
+print(myStack.stack)
+print(myStack.push(5)) 
+print(myStack.stack)
+print(myStack.push(3)) 
+print(myStack.stack)
+
+#The result of the above code
+True
+[5]
+True
+[5, 6]
+True
+[5, 6, 9]
+True
+[5, 6, 9, 5]
+True
+[5, 6, 9, 5, 3]
+```
+
+3. Check the current size of the stack by using the size() function.
+
+```python
+#The process of implimenting the size() function call
+print(myStack.size())   
+
+#The result of the code
+5
+```
+
+4. Remove elements from the stack by using the pop() function.
+
+```python
+#The process of implimenting the pop() function call
+print(myStack.pop())   #print the value of removed element
+print("Current stack :",myStack.stack)   #print the stack now
+print(myStack.pop())
+print("Current stack :",myStack.stack)
+print(myStack.pop())
+print("Current stack :",myStack.stack)
+print(myStack.pop())
+print("Current stack :",myStack.stack)
+print(myStack.pop())
+print("Current stack :",myStack.stack)
+print("the size of the stack now :",myStack.size())  #print the size of stack
+print(myStack.pop())
+
+#The result of the code
+3
+Current stack : [5, 6, 9, 5]
+5
+Current stack : [5, 6, 9]
+9
+Current stack : [5, 6]
+6
+Current stack : [5]
+5
+Current stack : []
+the size of the stack now : 0
+Stack Empty!
+```

From 5b07385b3368a9f9f102b3d4ef4446c9f1a4f225 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Sat, 29 Feb 2020 22:46:06 -0800
Subject: [PATCH 13/86] Created Stacks(4).md

Created Stacks(4).md
---
 Leetcode Workshops/Week 1/Stacks(4).md | 15 +++++++++++++++
 1 file changed, 15 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Stacks(4).md

diff --git a/Leetcode Workshops/Week 1/Stacks(4).md b/Leetcode Workshops/Week 1/Stacks(4).md
new file mode 100644
index 0000000..aef604e
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Stacks(4).md	
@@ -0,0 +1,15 @@
+### Type: Text + Image ###
+
+### Title: The Tower of Hanoi ###
+
+- The tower of Hanoi is a puzzle in which you have 3 poles and 3 disks of different sizes. You'll always start with the largest disk
+  on the bottom of the 1st pole and the smallest disk on the top of the 1st pole
+  
+- The goal is to see if we can sort the stack of disks in their original order by the time you stack the disks on the 3rd pole.
+
+- The rule of the puzzle is that you can't place a larger disk on a smaller disk and only one disk can be moved at a time.
+
+- In order to solve this puzzle, we need to use our good old friend, the stack class since the stack algorithm can remove the latest
+  item that was on top of the list and sort it into another pole into the proper order.
+  
+  ![](https://www.includehelp.com/data-structure-tutorial/images/tower-of-hanoi.jpg)

From 5f69f6245ea73eed68aa6479c2acf58a1f7d978c Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Sat, 29 Feb 2020 23:19:12 -0800
Subject: [PATCH 14/86] Created Stacks(5).md

Created Stacks(5).md
---
 Leetcode Workshops/Week 1/Stacks(5).md | 150 +++++++++++++++++++++++++
 1 file changed, 150 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Stacks(5).md

diff --git a/Leetcode Workshops/Week 1/Stacks(5).md b/Leetcode Workshops/Week 1/Stacks(5).md
new file mode 100644
index 0000000..f1f8f9e
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Stacks(5).md	
@@ -0,0 +1,150 @@
+### Type: Code steps Large ###
+
+### Title: Implementing the Stack Class for the Tower of Hanoi Puzzle ###
+
+- We're now going to solve the Tower of Hanoi puzzle using the stack class
+
+1. The 1st step is to initialize the necessary values that we will need for this puzzle (the disk sizes and the type of poles).
+
+```python
+#Initializing the necessary items
+sourcePole = Stack()
+auxPole = Stack()
+destPole = Stack()
+
+smallDisk = 1
+avgDisk = 2
+largeDisk = 3
+
+sourcePole.push(largeDisk)
+sourcePole.push(avgDisk)
+sourcePole.push(smallDisk)
+
+print(sourcePole.stack)  # print the Initial state of 3 poles
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[3, 2, 1]
+[]
+[]
+```
+
+2. The 2nd step is to place the smallest disk into our 3rd pole (`destPole`).
+
+```python
+#Moving the smallest disk to the 3rd pole
+disk = sourcePole.pop() #remove the top disk of source pole to destination pole
+destPole.push(disk)
+
+print(sourcePole.stack) #print the state now
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[3, 2]
+[]
+[1]
+```
+
+3. The 3rd step is to place the medium sized disk into our 2nd pole ('auxPole`).
+
+```python
+#Moving the medium sized disk into the 2nd pole
+disk = sourcePole.pop() #remove the top disk of source pole now to destination pole
+auxPole.push(disk)
+
+print(sourcePole.stack) #print the state now
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[3]
+[2]
+[1]
+```
+
+4. The 4th step is to place the smallest disk into our 2nd pole.
+
+```python
+#Moving the smallest disk into our 2nd pole
+disk=destPole.pop()
+auxPole.push(disk)
+
+print(sourcePole.stack)
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[3]
+[2, 1]
+[]
+```
+
+5. The 5th step is to place the largest disk into our 3rd pole.
+
+```python
+#Moving the largest disk into our 3rd pole
+disk=sourcePole.pop()
+destPole.push(disk)
+
+print(sourcePole.stack)
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[]
+[2, 1]
+[3]
+```
+
+6. The 6th step is to place the smallest disk into our 1st pole(`sourcePole`).
+
+```python
+#Moving the smallest disk into our 1st pole
+disk=auxPole.pop()
+sourcePole.push(disk)
+
+print(sourcePole.stack)
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[1]
+[2]
+[3]
+```
+
+7. The 7th step is to place the medium sized disk into our 3rd pole.
+
+```python
+#Moving the medium sized disk into our 3rd pole
+disk=auxPole.pop()
+destPole.push(disk)
+
+print(sourcePole.stack)
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[1]
+[]
+[3, 2]
+```
+
+8. The final step would be to place the smallest disk into the pole and just like that, we solved the Tower of Hanoi :)
+
+```python
+#Moving the smallest disk into our 3rd pole
+disk=sourcePole.pop()
+destPole.push(disk)
+
+print(sourcePole.stack)
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[]
+[]
+[3, 2, 1]
+```

From 8dadf8d90a232fa56112c9bf44cbbefc4dd57b43 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Sun, 1 Mar 2020 00:43:33 -0800
Subject: [PATCH 15/86] Made a mistake

Made a mistake
---
 Leetcode Workshops/Week 1/Stacks(1).md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Leetcode Workshops/Week 1/Stacks(1).md b/Leetcode Workshops/Week 1/Stacks(1).md
index fb1c79f..c90568a 100644
--- a/Leetcode Workshops/Week 1/Stacks(1).md	
+++ b/Leetcode Workshops/Week 1/Stacks(1).md	
@@ -7,7 +7,7 @@
 - How this data structure works is that earliest elements that are added into the stack will be on the bottom of the stack
   and the most recent element that is on the stack will get removed first.
   
-- This process is called LIFO (Last in, Last out).
+- This process is called LIFO (Last in, First out).
 
 - An example can be a stack of books. Say that you have a huge stack of books at the library and you want to access your Calculus
   textbook that's below your Physics, Circuts, and Chemistry textbooks.

From c28475384518adeee98a83892ef2017575415596 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Tue, 17 Mar 2020 17:47:30 -0700
Subject: [PATCH 16/86] Updated Queues Slide 1

Updated Queues Slide 1
---
 Leetcode Workshops/Week 1/Queues(1).md | 7 ++-----
 1 file changed, 2 insertions(+), 5 deletions(-)

diff --git a/Leetcode Workshops/Week 1/Queues(1).md b/Leetcode Workshops/Week 1/Queues(1).md
index 3de8b1f..d344399 100644
--- a/Leetcode Workshops/Week 1/Queues(1).md	
+++ b/Leetcode Workshops/Week 1/Queues(1).md	
@@ -4,12 +4,9 @@
 
 ### Content:
 
-- Queues are data structures that removes the first element that was added into a list.
+- Queues are data structures that remove the first element that was added into a list.
 
-- An example could be you wating at a long line at In-N-Out and the car that was there the earliest gets served first.
+- An example could be you waiting at a long line at In-N-Out and the car that was there the earliest gets served first.
 
 ![](https://coyotechronicle.net/wp-content/uploads/2012/04/IMG_0018-150x112.jpg)
 
-- Queues are implimented through adding elements to the rear of the queue and deleting elements at the front of the Queue.
-
-- This technique is known as FIFO (First in First out).

From 3cf6a5b5792caf9e680cc862c8275d0c8bfc8dda Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Tue, 17 Mar 2020 17:49:11 -0700
Subject: [PATCH 17/86] Created Faux Queues(2).md

Created Faux Queues(2).md
---
 Leetcode Workshops/Week 1/Faux Queues(2).md | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Queues(2).md

diff --git a/Leetcode Workshops/Week 1/Faux Queues(2).md b/Leetcode Workshops/Week 1/Faux Queues(2).md
new file mode 100644
index 0000000..5951aca
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Queues(2).md	
@@ -0,0 +1,11 @@
+### Type: Text + Image ###
+
+### Title: What's a Queue? ###
+
+### Content:
+
+- Queues are implemented through adding elements to the rear of the queue and deleting elements at the front of the Queue.
+
+- This technique is known as FIFO (First in First out).
+
+![](https://media.geeksforgeeks.org/wp-content/cdn-uploads/gq/2014/02/Queue.png)

From 30465b362da5b319637f10ea55df0f75d78a39ba Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 12:14:14 -0700
Subject: [PATCH 18/86] Rename

Rename
---
 Leetcode Workshops/Week 1/Faux Queues(3).md | 15 ++++++++
 Leetcode Workshops/Week 1/Queues(2).md      | 39 ---------------------
 2 files changed, 15 insertions(+), 39 deletions(-)
 create mode 100644 Leetcode Workshops/Week 1/Faux Queues(3).md
 delete mode 100644 Leetcode Workshops/Week 1/Queues(2).md

diff --git a/Leetcode Workshops/Week 1/Faux Queues(3).md b/Leetcode Workshops/Week 1/Faux Queues(3).md
new file mode 100644
index 0000000..774919f
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Queues(3).md	
@@ -0,0 +1,15 @@
+### Type of Card: Code left/right ###
+
+### Title: Implementing a Queue ###
+
+- We're going to make a Queue class to show how the Queue itself works.
+
+- The first step would be to create our queue constructor in which we start our queue off as an empty list for adding items
+
+```python
+
+class Queue:
+    #Constructor creates a list
+    def __init__(self):
+       self.queue=[]
+```
diff --git a/Leetcode Workshops/Week 1/Queues(2).md b/Leetcode Workshops/Week 1/Queues(2).md
deleted file mode 100644
index e3b95ed..0000000
--- a/Leetcode Workshops/Week 1/Queues(2).md	
+++ /dev/null
@@ -1,39 +0,0 @@
-### Type of Card: Code left/right ###
-
-### Title: Implementing a Queue ###
-
-- We're going to make a Queue class to show how the Queue itself works.
-
-- enqueue() adds elements to the rear of the queue.
-
-- dequeue() deletes elements from the front of the queue.
-
-- size() looks at the current size that the Queue has.
-
-- printQueue() prints out the current elements that are inside the queue
-
-```python
-
-class Queue:
-    #Constructor creates a list
-    def __init__(self):
-       self.queue=[]
-
-    #Adding elements to queue
-    def enqueue(self,data):
-        self.queue.insert(0,data)
-        return True
-
-    #Removing the last element from the queue
-    def dequeue(self):
-        return self.queue.pop()
-
-    #Getting the size of the queue
-    def size(self):
-        return len(self.queue)
-
-    #printing the elements of the queue
-    def printQueue(self):
-        return self.queue
-        
- ```

From 3ce11e45ab4c0ccfcfaa417afd361badd3af2250 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 12:15:13 -0700
Subject: [PATCH 19/86] Create Faux Queues(4).md

---
 Leetcode Workshops/Week 1/Faux Queues(4).md | 13 +++++++++++++
 1 file changed, 13 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Queues(4).md

diff --git a/Leetcode Workshops/Week 1/Faux Queues(4).md b/Leetcode Workshops/Week 1/Faux Queues(4).md
new file mode 100644
index 0000000..0690bff
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Queues(4).md	
@@ -0,0 +1,13 @@
+### Type of Card: Code left/right ###
+
+-We’re now going to create our enqueue() function in the queue class.
+
+- enqueue() adds elements to the rear of the queue.
+
+```python
+   
+ #Adding elements to queue
+    def enqueue(self,data):
+        self.queue.insert(0,data)
+        return True
+```

From a41c35cf1a1fa435dc6e87c625c647613ee4249a Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 12:16:41 -0700
Subject: [PATCH 20/86] Create Faux Queues(5).md

---
 Leetcode Workshops/Week 1/Faux Queues(5).md | 12 ++++++++++++
 1 file changed, 12 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Queues(5).md

diff --git a/Leetcode Workshops/Week 1/Faux Queues(5).md b/Leetcode Workshops/Week 1/Faux Queues(5).md
new file mode 100644
index 0000000..94ff6f8
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Queues(5).md	
@@ -0,0 +1,12 @@
+### Type of Card: Code left/right ###
+
+-We’re now going to create our dequeue() function in the queue class.
+
+- dequeue() deletes elements from the front of the queue.
+
+```python
+
+  #Removing the last element from the queue
+    def dequeue(self):
+        return self.queue.pop()
+```

From 4592b5628324703ecbcfb0957e5cd0a4985865cb Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 12:17:39 -0700
Subject: [PATCH 21/86] Create Faux Queues(6).md

---
 Leetcode Workshops/Week 1/Faux Queues(6).md | 12 ++++++++++++
 1 file changed, 12 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Queues(6).md

diff --git a/Leetcode Workshops/Week 1/Faux Queues(6).md b/Leetcode Workshops/Week 1/Faux Queues(6).md
new file mode 100644
index 0000000..6e49872
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Queues(6).md	
@@ -0,0 +1,12 @@
+### Type of Card: Code left/right ###
+
+-We’re now going to create our size() function in the queue class.
+
+- size() looks at the current size that the Queue has for its total number of elements.
+
+```python
+
+#Getting the size of the queue
+    def size(self):
+        return len(self.queue)
+```

From 41e2c6346898469747344ec96bd7cf4e91f10090 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 12:18:11 -0700
Subject: [PATCH 22/86] Create Faux Queues(7).md

---
 Leetcode Workshops/Week 1/Faux Queues(7).md | 12 ++++++++++++
 1 file changed, 12 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Queues(7).md

diff --git a/Leetcode Workshops/Week 1/Faux Queues(7).md b/Leetcode Workshops/Week 1/Faux Queues(7).md
new file mode 100644
index 0000000..e4d741d
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Queues(7).md	
@@ -0,0 +1,12 @@
+### Type of Card: Code left/right ###
+
+-Finally, we’re going to create our printQueue() function in our queue class.
+
+- printQueue() prints out the current elements that are left inside the queue
+
+```python
+
+    #printing the elements of the queue
+    def printQueue(self):
+        return self.queue
+```

From 6599fe7705f7eacc6282081fad58b5e155db5be2 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 12:56:55 -0700
Subject: [PATCH 23/86] Update and rename Queues(3).md to Queues(8).md

---
 Leetcode Workshops/Week 1/Queues(3).md | 44 --------------------------
 Leetcode Workshops/Week 1/Queues(8).md |  8 +++++
 2 files changed, 8 insertions(+), 44 deletions(-)
 delete mode 100644 Leetcode Workshops/Week 1/Queues(3).md
 create mode 100644 Leetcode Workshops/Week 1/Queues(8).md

diff --git a/Leetcode Workshops/Week 1/Queues(3).md b/Leetcode Workshops/Week 1/Queues(3).md
deleted file mode 100644
index af325ae..0000000
--- a/Leetcode Workshops/Week 1/Queues(3).md	
+++ /dev/null
@@ -1,44 +0,0 @@
-### Type: Code Steps Large ###
-
-### Title: What's a Deque? ###
-
-- A deque (or a double ended queue) is a data structure that removes and adds elements from either the front or the rear of a queue.
-
-- We're going to show you an example on how to implement a deque.
-
-1. Import the deque library.
-
-```python
-from collections import deque
-```
-
-2. Create your queue of elements while calling the deque function.
-
-```python
-# Creating a Queue
-queue = deque([1,5,8,9])
-```
-
-3. Append elements towards the rear of the queue.
-
-```python
-# Enqueuing elements to the Queue
-queue.append(7) #[1,5,8,9,7]
-queue.append(0) #[1,5,8,9,7,0]
-```
-
-4. This is where you can implement the deque() properly when you dequeuing elements. For deque, you would use the popleft() function
-   to delete elements in the front of the list (the version of deleting elements from the rear is popright()).
-   
-```python
-# Dequeuing elements from the Queue
-queue.popleft() #[5,8,9,7,0]
-queue.popleft() #[8,7,9,0]
-```
-
-5. You can call the print() function to check what elements are still in the queue.
-
-```python
-#Printing the elements of the Queue
-print(queue)
-```
diff --git a/Leetcode Workshops/Week 1/Queues(8).md b/Leetcode Workshops/Week 1/Queues(8).md
new file mode 100644
index 0000000..db28398
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Queues(8).md	
@@ -0,0 +1,8 @@
+### Type of Card: Text ###
+
+### Title: What’s a Deque? ###
+
+- A deque (or a double ended queue) is a data structure that removes and adds elements from either the front or the rear of a queue.
+
+- We're going to show you an example on how to implement a deque.
+

From 690901ad6d9f3326c1876a933994063547cdff60 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 12:57:44 -0700
Subject: [PATCH 24/86] Create Faux Queues(9).md

---
 Leetcode Workshops/Week 1/Faux Queues(9).md | 7 +++++++
 1 file changed, 7 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Queues(9).md

diff --git a/Leetcode Workshops/Week 1/Faux Queues(9).md b/Leetcode Workshops/Week 1/Faux Queues(9).md
new file mode 100644
index 0000000..c9c65e1
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Queues(9).md	
@@ -0,0 +1,7 @@
+### Type of Card: Code left/right ###
+
+- The 1st step would be to import the deque library from Python’s collection module.
+
+```python
+from collections import deque
+```

From f50fcfa882995bab60503455ee5df5dca6e5ee84 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 13:02:05 -0700
Subject: [PATCH 25/86] Create Faux Queues(10).md

---
 Leetcode Workshops/Week 1/Faux Queues(10).md | 8 ++++++++
 1 file changed, 8 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Queues(10).md

diff --git a/Leetcode Workshops/Week 1/Faux Queues(10).md b/Leetcode Workshops/Week 1/Faux Queues(10).md
new file mode 100644
index 0000000..0a85c63
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Queues(10).md	
@@ -0,0 +1,8 @@
+### Type of Card: Code left/right ###
+
+-The 2nd step would be to create your queue of elements while calling the deque function.
+
+```python
+# Creating a Queue
+queue = deque([1,5,8,9])
+```

From 075bfe3a524a4566d35ad63f40447566fd05c247 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 13:03:11 -0700
Subject: [PATCH 26/86] Create Faux Queues(11).md

---
 Leetcode Workshops/Week 1/Faux Queues(11).md | 9 +++++++++
 1 file changed, 9 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Queues(11).md

diff --git a/Leetcode Workshops/Week 1/Faux Queues(11).md b/Leetcode Workshops/Week 1/Faux Queues(11).md
new file mode 100644
index 0000000..c6a1fc4
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Queues(11).md	
@@ -0,0 +1,9 @@
+### Type of Card: Code left/right ###
+
+-The 3rd step would be to append elements towards the rear of the queue.
+
+```python
+# Enqueuing elements to the Queue
+queue.append(7) #[1,5,8,9,7]
+queue.append(0) #[1,5,8,9,7,0]
+```

From 9cf22e84e939800fa7338696a009c75ad4e639ec Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 13:04:05 -0700
Subject: [PATCH 27/86] Create Faux Queues(12).md

---
 Leetcode Workshops/Week 1/Faux Queues(12).md | 9 +++++++++
 1 file changed, 9 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Queues(12).md

diff --git a/Leetcode Workshops/Week 1/Faux Queues(12).md b/Leetcode Workshops/Week 1/Faux Queues(12).md
new file mode 100644
index 0000000..7e03522
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Queues(12).md	
@@ -0,0 +1,9 @@
+### Type of Card: Code left/right ###
+
+-This is where you can implement the deque() properly when you’re dequeuing elements. For deque, you would use the popleft() function to delete elements in the front of the list (the version of deleting elements from the rear is popright()).
+
+```python
+# Dequeuing elements from the Queue
+queue.popleft() #[5,8,9,7,0]
+queue.popleft() #[8,7,9,0]
+```

From bb25d2a9dae0cebb1e224aa6608c85980a7c1599 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 13:05:01 -0700
Subject: [PATCH 28/86] Create Faux Queues(13).md

---
 Leetcode Workshops/Week 1/Faux Queues(13).md | 7 +++++++
 1 file changed, 7 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Queues(13).md

diff --git a/Leetcode Workshops/Week 1/Faux Queues(13).md b/Leetcode Workshops/Week 1/Faux Queues(13).md
new file mode 100644
index 0000000..df74b4d
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Queues(13).md	
@@ -0,0 +1,7 @@
+### Type of Card: Code left/right ###
+
+-The final step would be to call the print() function to check what elements are still left in the queue.
+```python
+#Printing the elements of the Queue
+print(queue)
+```

From c7eca8770847a4cd32a4e3e300e9f13a2dd40a7e Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:03:16 -0700
Subject: [PATCH 29/86] Update and rename Queues(4).md to Queues(14).md

---
 Leetcode Workshops/Week 1/Queues(14).md | 11 ++++++++
 Leetcode Workshops/Week 1/Queues(4).md  | 37 -------------------------
 2 files changed, 11 insertions(+), 37 deletions(-)
 create mode 100644 Leetcode Workshops/Week 1/Queues(14).md
 delete mode 100644 Leetcode Workshops/Week 1/Queues(4).md

diff --git a/Leetcode Workshops/Week 1/Queues(14).md b/Leetcode Workshops/Week 1/Queues(14).md
new file mode 100644
index 0000000..7edf9a5
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Queues(14).md	
@@ -0,0 +1,11 @@
+### Type of Card: Text ###
+
+### Title: A Real-life Example of a Queue ###
+
+- You're probably thinking, "Learning about queues is cool and all, but when will I ever apply this in my life?"
+
+- Well today's your lucky day!
+
+- Let's say that you're boarding a plane and you're fighting to get the first front seats of the plane.
+
+![](https://thecontextofthings.com/wp-content/uploads/2014/04/tra2687.jpg)
diff --git a/Leetcode Workshops/Week 1/Queues(4).md b/Leetcode Workshops/Week 1/Queues(4).md
deleted file mode 100644
index a1cf57d..0000000
--- a/Leetcode Workshops/Week 1/Queues(4).md	
+++ /dev/null
@@ -1,37 +0,0 @@
-### Type: Code Steps Large ###
-
-### Title: A Real-life Example of a Queue ###
-
-- You're probably thinking, "Learning about queues is cool and all, but when will I ever apply this in my life?"
-
-- Well today's your lucky day!
-
-- Let's say that you're boarding a plane and you're fighting to get the first front seats of the plane.
-
-1. Let's say that the total amount of passengers is 50 people. Let's add each passenger in the plane using the enqueue() call
-   to fill up the number of spots available.
-   
-```python
-passengers = 50 #Total of the current 50 passengers on the plane
-boardingPlane = Queue()
-int(passengers) = 50
-
-for x in range(passengers):
-	boardingPlane.enqueue(x)
-  
-print(boardingPlane.size()) #result prints a size of 50
-```
-
-2. Now you're plane arrived at the Sacarmento airport and the first 30 passengers hopped off the plane while the last 20 waited
-   in the back because they're going to catch a different flight right after the plane has landed. We would now remove each of the 
-   30 passengers in order using the dequeue() call.
-   
-```python
-frontPassengers = 30 #1st 30 passengers that left the plane
-int frontPassengers = 30
-
-for x in range(frontPassengers):
-	boardingPlane.dequeue(x)
-
-print(boardingPlane.size()) #result prints a size of 20
-```

From 4150eaaa404823060cbc6080abea834e1fdbde6c Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:04:30 -0700
Subject: [PATCH 30/86] Create Faux Queues(15).md

---
 Leetcode Workshops/Week 1/Faux Queues(15).md | 15 +++++++++++++++
 1 file changed, 15 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Queues(15).md

diff --git a/Leetcode Workshops/Week 1/Faux Queues(15).md b/Leetcode Workshops/Week 1/Faux Queues(15).md
new file mode 100644
index 0000000..32ef08b
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Queues(15).md	
@@ -0,0 +1,15 @@
+### Type of Card: Code left/right ###
+
+-Let's say that the total number of passengers is 50 people. Let's add each passenger in the plane using the enqueue() call
+   to fill up the number of spots available.
+   
+```python
+passengers = 50 #Total of the current 50 passengers on the plane
+boardingPlane = Queue()
+int(passengers) = 50
+
+for x in range(passengers):
+	boardingPlane.enqueue(x)
+  
+print(boardingPlane.size()) #result prints a size of 50
+```

From bf4ba48c00c2af2890eeb5e00624f462510cb529 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:05:07 -0700
Subject: [PATCH 31/86] Create Faux Queues(16).md

---
 Leetcode Workshops/Week 1/Faux Queues(16).md | 15 +++++++++++++++
 1 file changed, 15 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Queues(16).md

diff --git a/Leetcode Workshops/Week 1/Faux Queues(16).md b/Leetcode Workshops/Week 1/Faux Queues(16).md
new file mode 100644
index 0000000..ff15305
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Queues(16).md	
@@ -0,0 +1,15 @@
+### Type of Card: Code left/right ###
+
+-Now you're plane arrived at the Sacramento airport and the first 30 passengers hopped off the plane while the last 20 waited
+   in the back because they're going to catch a different flight right after the plane has landed. We would now remove each of the 
+   30 passengers in order using the dequeue() call.
+   
+```python
+frontPassengers = 30 #1st 30 passengers that left the plane
+int frontPassengers = 30
+
+for x in range(frontPassengers):
+	boardingPlane.dequeue(x)
+
+print(boardingPlane.size()) #result prints a size of 20
+```

From d0afdd18eb40911a60af30d1ea18064604099315 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:05:29 -0700
Subject: [PATCH 32/86] Rename Faux Queues(2).md to Queues(2).md

---
 Leetcode Workshops/Week 1/{Faux Queues(2).md => Queues(2).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Queues(2).md => Queues(2).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Queues(2).md b/Leetcode Workshops/Week 1/Queues(2).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Queues(2).md
rename to Leetcode Workshops/Week 1/Queues(2).md

From c43076ada5156ee2646afb3a8b573c48187a16a2 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:05:52 -0700
Subject: [PATCH 33/86] Rename Faux Queues(3).md to Queues(3).md

---
 Leetcode Workshops/Week 1/{Faux Queues(3).md => Queues(3).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Queues(3).md => Queues(3).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Queues(3).md b/Leetcode Workshops/Week 1/Queues(3).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Queues(3).md
rename to Leetcode Workshops/Week 1/Queues(3).md

From 538f8d05700578a9bfea2d1eb280c5ee60bb83a9 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:06:29 -0700
Subject: [PATCH 34/86] Rename Faux Queues(4).md to Queues(4).md

---
 Leetcode Workshops/Week 1/{Faux Queues(4).md => Queues(4).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Queues(4).md => Queues(4).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Queues(4).md b/Leetcode Workshops/Week 1/Queues(4).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Queues(4).md
rename to Leetcode Workshops/Week 1/Queues(4).md

From d6a118600f3374280cce59f1b60b992b2b76c17b Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:06:43 -0700
Subject: [PATCH 35/86] Rename Faux Queues(5).md to Queues(5).md

---
 Leetcode Workshops/Week 1/{Faux Queues(5).md => Queues(5).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Queues(5).md => Queues(5).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Queues(5).md b/Leetcode Workshops/Week 1/Queues(5).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Queues(5).md
rename to Leetcode Workshops/Week 1/Queues(5).md

From 140ff510f953d4e610272b89b20d761593e8932d Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:07:07 -0700
Subject: [PATCH 36/86] Rename Faux Queues(6).md to Queues(6).md

---
 Leetcode Workshops/Week 1/{Faux Queues(6).md => Queues(6).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Queues(6).md => Queues(6).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Queues(6).md b/Leetcode Workshops/Week 1/Queues(6).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Queues(6).md
rename to Leetcode Workshops/Week 1/Queues(6).md

From 2b810e1ff46ba66924124499180e3292acc62088 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:07:58 -0700
Subject: [PATCH 37/86] Rename Faux Queues(7).md to Queues(7).md

---
 Leetcode Workshops/Week 1/{Faux Queues(7).md => Queues(7).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Queues(7).md => Queues(7).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Queues(7).md b/Leetcode Workshops/Week 1/Queues(7).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Queues(7).md
rename to Leetcode Workshops/Week 1/Queues(7).md

From 2e546bc794b3412fb1203389c05f02fe0418962f Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:08:26 -0700
Subject: [PATCH 38/86] Rename Faux Queues(9).md to Queues(9).md

---
 Leetcode Workshops/Week 1/{Faux Queues(9).md => Queues(9).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Queues(9).md => Queues(9).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Queues(9).md b/Leetcode Workshops/Week 1/Queues(9).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Queues(9).md
rename to Leetcode Workshops/Week 1/Queues(9).md

From fde1c650ca0fd7a13147a3257ad2c84b0662c21a Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:08:42 -0700
Subject: [PATCH 39/86] Rename Faux Queues(10).md to Queues(10).md

---
 Leetcode Workshops/Week 1/{Faux Queues(10).md => Queues(10).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Queues(10).md => Queues(10).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Queues(10).md b/Leetcode Workshops/Week 1/Queues(10).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Queues(10).md
rename to Leetcode Workshops/Week 1/Queues(10).md

From a16ea0b599f73aba13ea17e2c7f9843a776ad48f Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:09:03 -0700
Subject: [PATCH 40/86] Rename Faux Queues(11).md to Queues(11).md

---
 Leetcode Workshops/Week 1/{Faux Queues(11).md => Queues(11).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Queues(11).md => Queues(11).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Queues(11).md b/Leetcode Workshops/Week 1/Queues(11).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Queues(11).md
rename to Leetcode Workshops/Week 1/Queues(11).md

From 6195a7d249ddc78e7a388676c11a553aa062c78a Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:09:40 -0700
Subject: [PATCH 41/86] Rename Faux Queues(12).md to Queues(12).md

---
 Leetcode Workshops/Week 1/{Faux Queues(12).md => Queues(12).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Queues(12).md => Queues(12).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Queues(12).md b/Leetcode Workshops/Week 1/Queues(12).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Queues(12).md
rename to Leetcode Workshops/Week 1/Queues(12).md

From e1205c24d07ef34eefe5db3e190f95f3f252130b Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:10:56 -0700
Subject: [PATCH 42/86] Rename Faux Queues(13).md to Queues(13).md

---
 Leetcode Workshops/Week 1/{Faux Queues(13).md => Queues(13).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Queues(13).md => Queues(13).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Queues(13).md b/Leetcode Workshops/Week 1/Queues(13).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Queues(13).md
rename to Leetcode Workshops/Week 1/Queues(13).md

From aab571414e4195ecbbf34145081f5d60152879bb Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:11:19 -0700
Subject: [PATCH 43/86] Rename Faux Queues(15).md to Queues(15).md

---
 Leetcode Workshops/Week 1/{Faux Queues(15).md => Queues(15).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Queues(15).md => Queues(15).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Queues(15).md b/Leetcode Workshops/Week 1/Queues(15).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Queues(15).md
rename to Leetcode Workshops/Week 1/Queues(15).md

From 5b21dba412474efbc485a78270c63a878366969b Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:11:33 -0700
Subject: [PATCH 44/86] Rename Faux Queues(16).md to Queues(16).md

---
 Leetcode Workshops/Week 1/{Faux Queues(16).md => Queues(16).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Queues(16).md => Queues(16).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Queues(16).md b/Leetcode Workshops/Week 1/Queues(16).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Queues(16).md
rename to Leetcode Workshops/Week 1/Queues(16).md

From e2fec0408c4a4c3ed82866a3e98fa22244757fff Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:12:32 -0700
Subject: [PATCH 45/86] Update Queues(14).md

---
 Leetcode Workshops/Week 1/Queues(14).md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Leetcode Workshops/Week 1/Queues(14).md b/Leetcode Workshops/Week 1/Queues(14).md
index 7edf9a5..be82c85 100644
--- a/Leetcode Workshops/Week 1/Queues(14).md	
+++ b/Leetcode Workshops/Week 1/Queues(14).md	
@@ -1,4 +1,4 @@
-### Type of Card: Text ###
+### Type of Card: Text + image ###
 
 ### Title: A Real-life Example of a Queue ###
 

From 2f74098eccec2054ab57e0e393c88e85505c2b1c Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:40:51 -0700
Subject: [PATCH 46/86] Update Stacks(1).md

---
 Leetcode Workshops/Week 1/Stacks(1).md | 15 +--------------
 1 file changed, 1 insertion(+), 14 deletions(-)

diff --git a/Leetcode Workshops/Week 1/Stacks(1).md b/Leetcode Workshops/Week 1/Stacks(1).md
index c90568a..97a9b51 100644
--- a/Leetcode Workshops/Week 1/Stacks(1).md	
+++ b/Leetcode Workshops/Week 1/Stacks(1).md	
@@ -9,17 +9,4 @@
   
 - This process is called LIFO (Last in, First out).
 
-- An example can be a stack of books. Say that you have a huge stack of books at the library and you want to access your Calculus
-  textbook that's below your Physics, Circuts, and Chemistry textbooks.
-  
-- This is where you get to see the wonderful implementation of using a stack.
-
-- You would remove the most recent book that's on top of your stack (this is what we call popping an item into a stack) in order until
-  you can access your textbook.
-  
-- Congratulations! You can now work on those wonderful triple integrals that you have to do for your homework :`)
-
-- After finishing your homework, you can put your textbooks back on top of your calculus textbook (this is what we call pushing an
-  an item into a stack).
-  
-  ![](https://ya-webdesign.com/transparent250_/stack-of-clipart-tall-2.png)
+![](https://media.geeksforgeeks.org/wp-content/cdn-uploads/gq/2013/03/stack.png)

From fb242e95ee929c9a9816b729b7f273f40cca1ad5 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 14:41:32 -0700
Subject: [PATCH 47/86] Create Faux Stacks(2).md

---
 Leetcode Workshops/Week 1/Faux Stacks(2).md | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(2).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(2).md b/Leetcode Workshops/Week 1/Faux Stacks(2).md
new file mode 100644
index 0000000..b38d500
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(2).md	
@@ -0,0 +1,18 @@
+### Type: Text + Image ###
+
+### A Real-Life Example of a Stack ###
+
+- An example can be a stack of books. Say that you have a huge stack of books at the library and you want to access your Calculus
+  textbook that's below your Physics, Circuits, and Chemistry textbooks.
+  
+- This is where you get to see the wonderful implementation of using a stack.
+
+- You would remove the most recent book that's on top of your stack (this is what we call popping an item into a stack) in order until
+  you can access your textbook.
+  
+- Congratulations! You can now work on those wonderful triple integrals that you have to do for your homework :`)
+
+- After finishing your homework, you can put your textbooks back on top of your calculus textbook (this is what we call pushing an
+  an item into a stack).
+  
+  ![](https://ya-webdesign.com/transparent250_/stack-of-clipart-tall-2.png)

From 8487f0577ae6cc089b9a276fe680272fb4195e35 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 15:33:42 -0700
Subject: [PATCH 48/86] Update and rename Stacks(2).md to Faux Stacks(3).md

---
 Leetcode Workshops/Week 1/Faux Stacks(3).md | 13 ++++++
 Leetcode Workshops/Week 1/Stacks(2).md      | 49 ---------------------
 2 files changed, 13 insertions(+), 49 deletions(-)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(3).md
 delete mode 100644 Leetcode Workshops/Week 1/Stacks(2).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(3).md b/Leetcode Workshops/Week 1/Faux Stacks(3).md
new file mode 100644
index 0000000..75133f7
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(3).md	
@@ -0,0 +1,13 @@
+### Type: Code steps large ###
+
+### Title: Implementing a Stack ###
+
+- Now that you have seen an example of what a stack is, let's put this knowledge into practice.
+
+- Before we get into the code, we should go over how each function in a stack works.
+
+- push() adds elements to the front of the stack (stacking items on top) and pop() removes the latest elements that are on top of the
+  stack.
+  
+- Now that you know these basics, let's make our stack class.
+
diff --git a/Leetcode Workshops/Week 1/Stacks(2).md b/Leetcode Workshops/Week 1/Stacks(2).md
deleted file mode 100644
index 438c498..0000000
--- a/Leetcode Workshops/Week 1/Stacks(2).md	
+++ /dev/null
@@ -1,49 +0,0 @@
-### Type: Code steps large ###
-
-### Title: Implementing a Stack ###
-
-- Now that you have seen an example of what a stack is, let's put this knowledge into practice.
-
-- Before we get into the code, we should go over how each function in a stack works.
-
-- push() adds elements to the front of the stack (stacking items on top) and pop() remeoves the latest elements that are on top of the
-  stack.
-  
-- Now that you know these basics, let's make our stack class.
-
-1. The 1st step is to intialize our stack class with stack() being an empty list.
-
-```python
-class Stack:
-
-    #Constructor creates a list
-    def __init__(self):
-        self.stack = list()
-```
-
-2. The 2nd step is to create a push() function that adds elements to the stack.
-
-```python
-  #Adding elements to stack
-    def push(self,data):
-        self.stack.append(data)
-        return True
-```
-
-3. The 3rd step is to create a pop() function that removes elements from the stack.
-
-```python
-  #Removing last element from the stack
-    def pop(self):
-        if len(self.stack)<=0:
-            return ("Stack Empty!")
-        return self.stack.pop()
-```
-
-4. The final step is to create a size() function that returns our current size of the stack.
-
-```python
-#Getting the size of the stack
-    def size(self):
-        return len(self.stack)
-````

From d342f6a6d941854ac4a0810a911a2ede3dff51d3 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 15:34:18 -0700
Subject: [PATCH 49/86] Create Faux Stacks(4).md

---
 Leetcode Workshops/Week 1/Faux Stacks(4).md | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(4).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(4).md b/Leetcode Workshops/Week 1/Faux Stacks(4).md
new file mode 100644
index 0000000..98710fd
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(4).md	
@@ -0,0 +1,11 @@
+### Type: Code steps large ###
+
+ The 1st step is to intialize our stack class with stack() being an empty list.
+
+```python
+class Stack:
+
+    #Constructor creates a list
+    def __init__(self):
+        self.stack = list()
+```

From f8b34b5679f98a740efca5371600c600d0e08e48 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 15:34:55 -0700
Subject: [PATCH 50/86] Create Faux Stacks(5).md

---
 Leetcode Workshops/Week 1/Faux Stacks(5).md | 10 ++++++++++
 1 file changed, 10 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(5).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(5).md b/Leetcode Workshops/Week 1/Faux Stacks(5).md
new file mode 100644
index 0000000..ad7a54d
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(5).md	
@@ -0,0 +1,10 @@
+### Type: Code steps large ###
+
+The 2nd step is to create a push() function that adds elements to the stack.
+
+```python
+  #Adding elements to stack
+    def push(self,data):
+        self.stack.append(data)
+        return True
+```

From a9e8e37770bd8af666760f8c06c583569c3530f0 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 15:35:19 -0700
Subject: [PATCH 51/86] Create Faux Stacks(6).md

---
 Leetcode Workshops/Week 1/Faux Stacks(6).md | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(6).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(6).md b/Leetcode Workshops/Week 1/Faux Stacks(6).md
new file mode 100644
index 0000000..b953400
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(6).md	
@@ -0,0 +1,11 @@
+### Type: Code steps large ###
+
+The 3rd step is to create a pop() function that removes elements from the stack.
+
+```python
+  #Removing last element from the stack
+    def pop(self):
+        if len(self.stack)<=0:
+            return ("Stack Empty!")
+        return self.stack.pop()
+```

From 89e379559631a744d5d962b982cf4546014b5b3a Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 15:36:02 -0700
Subject: [PATCH 52/86] Create Faux Stacks(7).md

---
 Leetcode Workshops/Week 1/Faux Stacks(7).md | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(7).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(7).md b/Leetcode Workshops/Week 1/Faux Stacks(7).md
new file mode 100644
index 0000000..b0654ea
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(7).md	
@@ -0,0 +1,11 @@
+Faux Slide 7:
+
+### Type: Code steps large ###
+
+The final step is to create a size() function that returns our current size of the stack.
+
+```python
+#Getting the size of the stack
+    def size(self):
+        return len(self.stack)
+````

From 9859127f8921dcdaea9b01536a1ab5042ac53be2 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 17:58:29 -0700
Subject: [PATCH 53/86] Update Stacks(3).md

---
 Leetcode Workshops/Week 1/Stacks(3).md | 83 ++++----------------------
 1 file changed, 12 insertions(+), 71 deletions(-)

diff --git a/Leetcode Workshops/Week 1/Stacks(3).md b/Leetcode Workshops/Week 1/Stacks(3).md
index f35cb82..c4021e0 100644
--- a/Leetcode Workshops/Week 1/Stacks(3).md	
+++ b/Leetcode Workshops/Week 1/Stacks(3).md	
@@ -1,82 +1,23 @@
-### Type: Code Steps Large ###
-
-### Title: Testing out your Stack Class ###
+### Type: Code steps large ###
 
-- If you're curious on testing out your stack class, here's an example of how to do it.
-
-1. Initialize your stack class to a stack variable that you're creating.
+The final step is to create a size() function that returns our current size of the stack.
 
 ```python
-myStack = Stack()
-```
-
-2. Add elements to your stack through calling the push() function.
+#Getting the size of the stack
+    def size(self):
+        return len(self.stack)
+````
 
-```python
-#The process of implimenting push() call for stack
-myStack = Stack()
-print(myStack.push(5)) #prints whether the operation "push" successes
-print(myStack.stack)   #print the stack(left is bottom of the stack,right is the top of stack)
-print(myStack.push(6)) 
-print(myStack.stack)
-print(myStack.push(9)) 
-print(myStack.stack)
-print(myStack.push(5)) 
-print(myStack.stack)
-print(myStack.push(3)) 
-print(myStack.stack)
+Slide 3 (Faux Slide 8):
 
-#The result of the above code
-True
-[5]
-True
-[5, 6]
-True
-[5, 6, 9]
-True
-[5, 6, 9, 5]
-True
-[5, 6, 9, 5, 3]
-```
+### Type: Code Steps Large ###
 
-3. Check the current size of the stack by using the size() function.
+### Title: Testing out your Stack Class ###
 
-```python
-#The process of implimenting the size() function call
-print(myStack.size())   
+- If you're curious about testing out your stack class, here's an example of how to do it.
 
-#The result of the code
-5
-```
-
-4. Remove elements from the stack by using the pop() function.
+1. Initialize your stack class to a stack variable that you're creating.
 
 ```python
-#The process of implimenting the pop() function call
-print(myStack.pop())   #print the value of removed element
-print("Current stack :",myStack.stack)   #print the stack now
-print(myStack.pop())
-print("Current stack :",myStack.stack)
-print(myStack.pop())
-print("Current stack :",myStack.stack)
-print(myStack.pop())
-print("Current stack :",myStack.stack)
-print(myStack.pop())
-print("Current stack :",myStack.stack)
-print("the size of the stack now :",myStack.size())  #print the size of stack
-print(myStack.pop())
-
-#The result of the code
-3
-Current stack : [5, 6, 9, 5]
-5
-Current stack : [5, 6, 9]
-9
-Current stack : [5, 6]
-6
-Current stack : [5]
-5
-Current stack : []
-the size of the stack now : 0
-Stack Empty!
+myStack = Stack()
 ```

From 9133072b17100e0d6fc648afdc22c8d8beb9bb9a Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 17:58:51 -0700
Subject: [PATCH 54/86] Rename Stacks(3).md to Faux Stacks(8).md

---
 Leetcode Workshops/Week 1/{Stacks(3).md => Faux Stacks(8).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Stacks(3).md => Faux Stacks(8).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Stacks(3).md b/Leetcode Workshops/Week 1/Faux Stacks(8).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Stacks(3).md
rename to Leetcode Workshops/Week 1/Faux Stacks(8).md

From 02c73b6019724b31e90daf0545c8c894752093a6 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 17:59:32 -0700
Subject: [PATCH 55/86] Update Faux Stacks(8).md

---
 Leetcode Workshops/Week 1/Faux Stacks(8).md | 13 +------------
 1 file changed, 1 insertion(+), 12 deletions(-)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(8).md b/Leetcode Workshops/Week 1/Faux Stacks(8).md
index c4021e0..c981907 100644
--- a/Leetcode Workshops/Week 1/Faux Stacks(8).md	
+++ b/Leetcode Workshops/Week 1/Faux Stacks(8).md	
@@ -1,15 +1,3 @@
-### Type: Code steps large ###
-
-The final step is to create a size() function that returns our current size of the stack.
-
-```python
-#Getting the size of the stack
-    def size(self):
-        return len(self.stack)
-````
-
-Slide 3 (Faux Slide 8):
-
 ### Type: Code Steps Large ###
 
 ### Title: Testing out your Stack Class ###
@@ -21,3 +9,4 @@ Slide 3 (Faux Slide 8):
 ```python
 myStack = Stack()
 ```
+

From b85b87868206ec4c8f1725ac7ef5a5ec9a7187c8 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:00:20 -0700
Subject: [PATCH 56/86] Create Faux Stacks(9).md

---
 Leetcode Workshops/Week 1/Faux Stacks(9).md | 30 +++++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(9).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(9).md b/Leetcode Workshops/Week 1/Faux Stacks(9).md
new file mode 100644
index 0000000..f74e7f3
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(9).md	
@@ -0,0 +1,30 @@
+### Type: Code Steps Large ###
+
+2. Add elements to your stack through calling the push() function.
+
+```python
+#The process of implementing push() call for stack
+myStack = Stack()
+print(myStack.push(5)) #prints whether the operation "push" successes
+print(myStack.stack)   #print the stack(left is bottom of the stack,right is the top of stack)
+print(myStack.push(6)) 
+print(myStack.stack)
+print(myStack.push(9)) 
+print(myStack.stack)
+print(myStack.push(5)) 
+print(myStack.stack)
+print(myStack.push(3)) 
+print(myStack.stack)
+
+#The result of the above code
+True
+[5]
+True
+[5, 6]
+True
+[5, 6, 9]
+True
+[5, 6, 9, 5]
+True
+[5, 6, 9, 5, 3]
+```

From 28f934a6e75abba6806c35c18d1db4070a6cda02 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:01:05 -0700
Subject: [PATCH 57/86] Create Faux Stacks(10).md

---
 Leetcode Workshops/Week 1/Faux Stacks(10).md | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(10).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(10).md b/Leetcode Workshops/Week 1/Faux Stacks(10).md
new file mode 100644
index 0000000..f95da3c
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(10).md	
@@ -0,0 +1,11 @@
+### Type: Code Steps Large ###
+
+3. Check the current size of the stack by using the size() function.
+
+```python
+#The process of implementing the size() function call
+print(myStack.size())   
+
+#The result of the code
+5
+```

From 4d73ce1fbec3a2cf539c154f0d3b8de67b4965b6 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:02:09 -0700
Subject: [PATCH 58/86] Create Faux Stacks(11).md

---
 Leetcode Workshops/Week 1/Faux Stacks(11).md | 32 ++++++++++++++++++++
 1 file changed, 32 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(11).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(11).md b/Leetcode Workshops/Week 1/Faux Stacks(11).md
new file mode 100644
index 0000000..391fff8
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(11).md	
@@ -0,0 +1,32 @@
+### Type: Code Steps Large ###
+4. Remove elements from the stack by using the pop() function.
+
+```python
+#The process of implementing the pop() function call
+print(myStack.pop())   #print the value of removed element
+print("Current stack :",myStack.stack)   #print the stack now
+print(myStack.pop())
+print("Current stack :",myStack.stack)
+print(myStack.pop())
+print("Current stack :",myStack.stack)
+print(myStack.pop())
+print("Current stack :",myStack.stack)
+print(myStack.pop())
+print("Current stack :",myStack.stack)
+print("the size of the stack now :",myStack.size())  #print the size of stack
+print(myStack.pop())
+
+#The result of the code
+3
+Current stack : [5, 6, 9, 5]
+5
+Current stack : [5, 6, 9]
+9
+Current stack : [5, 6]
+6
+Current stack : [5]
+5
+Current stack : []
+the size of the stack now : 0
+Stack Empty!
+```

From c914c454cc77ffe6408111f4ff5ed06b5ededa78 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:30:55 -0700
Subject: [PATCH 59/86] Update and rename Stacks(5).md to Faux Stacks(13).md

---
 Leetcode Workshops/Week 1/Faux Stacks(13).md |  32 ++++
 Leetcode Workshops/Week 1/Stacks(5).md       | 150 -------------------
 2 files changed, 32 insertions(+), 150 deletions(-)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(13).md
 delete mode 100644 Leetcode Workshops/Week 1/Stacks(5).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(13).md b/Leetcode Workshops/Week 1/Faux Stacks(13).md
new file mode 100644
index 0000000..29b1321
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(13).md	
@@ -0,0 +1,32 @@
+### Type: Code steps Large ###
+
+### Title: Implementing the Stack Class for the Tower of Hanoi Puzzle ###
+
+- We're now going to solve the Tower of Hanoi puzzle using the stack class
+
+1. The 1st step is to initialize the necessary values that we will need for this puzzle (the disk sizes and the type of poles).
+
+```python
+#Initializing the necessary items
+sourcePole = Stack()
+auxPole = Stack()
+destPole = Stack()
+
+smallDisk = 1
+avgDisk = 2
+largeDisk = 3
+
+sourcePole.push(largeDisk)
+sourcePole.push(avgDisk)
+sourcePole.push(smallDisk)
+
+print(sourcePole.stack)  # print the Initial state of 3 poles
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[3, 2, 1]
+[]
+[]
+```
+
diff --git a/Leetcode Workshops/Week 1/Stacks(5).md b/Leetcode Workshops/Week 1/Stacks(5).md
deleted file mode 100644
index f1f8f9e..0000000
--- a/Leetcode Workshops/Week 1/Stacks(5).md	
+++ /dev/null
@@ -1,150 +0,0 @@
-### Type: Code steps Large ###
-
-### Title: Implementing the Stack Class for the Tower of Hanoi Puzzle ###
-
-- We're now going to solve the Tower of Hanoi puzzle using the stack class
-
-1. The 1st step is to initialize the necessary values that we will need for this puzzle (the disk sizes and the type of poles).
-
-```python
-#Initializing the necessary items
-sourcePole = Stack()
-auxPole = Stack()
-destPole = Stack()
-
-smallDisk = 1
-avgDisk = 2
-largeDisk = 3
-
-sourcePole.push(largeDisk)
-sourcePole.push(avgDisk)
-sourcePole.push(smallDisk)
-
-print(sourcePole.stack)  # print the Initial state of 3 poles
-print(auxPole.stack)
-print(destPole.stack)
-
-#Result of the code
-[3, 2, 1]
-[]
-[]
-```
-
-2. The 2nd step is to place the smallest disk into our 3rd pole (`destPole`).
-
-```python
-#Moving the smallest disk to the 3rd pole
-disk = sourcePole.pop() #remove the top disk of source pole to destination pole
-destPole.push(disk)
-
-print(sourcePole.stack) #print the state now
-print(auxPole.stack)
-print(destPole.stack)
-
-#Result of the code
-[3, 2]
-[]
-[1]
-```
-
-3. The 3rd step is to place the medium sized disk into our 2nd pole ('auxPole`).
-
-```python
-#Moving the medium sized disk into the 2nd pole
-disk = sourcePole.pop() #remove the top disk of source pole now to destination pole
-auxPole.push(disk)
-
-print(sourcePole.stack) #print the state now
-print(auxPole.stack)
-print(destPole.stack)
-
-#Result of the code
-[3]
-[2]
-[1]
-```
-
-4. The 4th step is to place the smallest disk into our 2nd pole.
-
-```python
-#Moving the smallest disk into our 2nd pole
-disk=destPole.pop()
-auxPole.push(disk)
-
-print(sourcePole.stack)
-print(auxPole.stack)
-print(destPole.stack)
-
-#Result of the code
-[3]
-[2, 1]
-[]
-```
-
-5. The 5th step is to place the largest disk into our 3rd pole.
-
-```python
-#Moving the largest disk into our 3rd pole
-disk=sourcePole.pop()
-destPole.push(disk)
-
-print(sourcePole.stack)
-print(auxPole.stack)
-print(destPole.stack)
-
-#Result of the code
-[]
-[2, 1]
-[3]
-```
-
-6. The 6th step is to place the smallest disk into our 1st pole(`sourcePole`).
-
-```python
-#Moving the smallest disk into our 1st pole
-disk=auxPole.pop()
-sourcePole.push(disk)
-
-print(sourcePole.stack)
-print(auxPole.stack)
-print(destPole.stack)
-
-#Result of the code
-[1]
-[2]
-[3]
-```
-
-7. The 7th step is to place the medium sized disk into our 3rd pole.
-
-```python
-#Moving the medium sized disk into our 3rd pole
-disk=auxPole.pop()
-destPole.push(disk)
-
-print(sourcePole.stack)
-print(auxPole.stack)
-print(destPole.stack)
-
-#Result of the code
-[1]
-[]
-[3, 2]
-```
-
-8. The final step would be to place the smallest disk into the pole and just like that, we solved the Tower of Hanoi :)
-
-```python
-#Moving the smallest disk into our 3rd pole
-disk=sourcePole.pop()
-destPole.push(disk)
-
-print(sourcePole.stack)
-print(auxPole.stack)
-print(destPole.stack)
-
-#Result of the code
-[]
-[]
-[3, 2, 1]
-```

From e31e5275410b931bc1b4523c9a0930acc2e41b68 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:31:45 -0700
Subject: [PATCH 60/86] Create Faux Stacks(14).md

---
 Leetcode Workshops/Week 1/Faux Stacks(14).md | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(14).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(14).md b/Leetcode Workshops/Week 1/Faux Stacks(14).md
new file mode 100644
index 0000000..2ada63a
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(14).md	
@@ -0,0 +1,18 @@
+### Type: Code Steps Large ###
+
+2. The 2nd step is to place the smallest disk into our 3rd pole (`destPole`).
+
+```python
+#Moving the smallest disk to the 3rd pole
+disk = sourcePole.pop() #remove the top disk of source pole to destination pole
+destPole.push(disk)
+
+print(sourcePole.stack) #print the state now
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[3, 2]
+[]
+[1]
+```

From c791b0f3bb30fad320e772e1df4f61aafe5b173b Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:32:37 -0700
Subject: [PATCH 61/86] Create Faux Stacks(15).md

---
 Leetcode Workshops/Week 1/Faux Stacks(15).md | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(15).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(15).md b/Leetcode Workshops/Week 1/Faux Stacks(15).md
new file mode 100644
index 0000000..a9781b2
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(15).md	
@@ -0,0 +1,18 @@
+### Type: Code Steps Large ###
+
+3. The 3rd step is to place the medium sized disk into our 2nd pole ('auxPole`).
+
+```python
+#Moving the medium sized disk into the 2nd pole
+disk = sourcePole.pop() #remove the top disk of source pole now to destination pole
+auxPole.push(disk)
+
+print(sourcePole.stack) #print the state now
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[3]
+[2]
+[1]
+```

From b95d91e145ee6dfda96020beafc29fc33800eaca Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:33:08 -0700
Subject: [PATCH 62/86] Create Faux Stacks(16).md

---
 Leetcode Workshops/Week 1/Faux Stacks(16).md | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(16).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(16).md b/Leetcode Workshops/Week 1/Faux Stacks(16).md
new file mode 100644
index 0000000..990e32e
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(16).md	
@@ -0,0 +1,18 @@
+### Type: Code Steps Large ###
+
+4. The 4th step is to place the smallest disk into our 2nd pole.
+
+```python
+#Moving the smallest disk into our 2nd pole
+disk=destPole.pop()
+auxPole.push(disk)
+
+print(sourcePole.stack)
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[3]
+[2, 1]
+[]
+```

From 83db18bedf1cdef9fda2d3b58668bb997e7e3491 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:33:50 -0700
Subject: [PATCH 63/86] Create Faux Stacks(17).md

---
 Leetcode Workshops/Week 1/Faux Stacks(17).md | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(17).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(17).md b/Leetcode Workshops/Week 1/Faux Stacks(17).md
new file mode 100644
index 0000000..88fc5ef
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(17).md	
@@ -0,0 +1,18 @@
+### Type: Code Steps Large ###
+
+5. The 5th step is to place the largest disk into our 3rd pole.
+
+```python
+#Moving the largest disk into our 3rd pole
+disk=sourcePole.pop()
+destPole.push(disk)
+
+print(sourcePole.stack)
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[]
+[2, 1]
+[3]
+```

From ea44e4a58cb78b1abefbc7f16f610d1471b050b3 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:34:27 -0700
Subject: [PATCH 64/86] Create Faux Stacks(18).md

---
 Leetcode Workshops/Week 1/Faux Stacks(18).md | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(18).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(18).md b/Leetcode Workshops/Week 1/Faux Stacks(18).md
new file mode 100644
index 0000000..8cf9efd
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(18).md	
@@ -0,0 +1,18 @@
+### Type: Code Steps Large ###
+
+6. The 6th step is to place the smallest disk into our 1st pole(`sourcePole`).
+
+```python
+#Moving the smallest disk into our 1st pole
+disk=auxPole.pop()
+sourcePole.push(disk)
+
+print(sourcePole.stack)
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[1]
+[2]
+[3]
+```

From bc5a532745844c0e0980767207e52fa5d87d27fb Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:35:32 -0700
Subject: [PATCH 65/86] Create Faux Stacks(19).md

---
 Leetcode Workshops/Week 1/Faux Stacks(19).md | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(19).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(19).md b/Leetcode Workshops/Week 1/Faux Stacks(19).md
new file mode 100644
index 0000000..5a220d7
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(19).md	
@@ -0,0 +1,17 @@
+### Type: Code Steps Large ###
+7. The 7th step is to place the medium sized disk into our 3rd pole.
+
+```python
+#Moving the medium sized disk into our 3rd pole
+disk=auxPole.pop()
+destPole.push(disk)
+
+print(sourcePole.stack)
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[1]
+[]
+[3, 2]
+```

From aac1f065960ed3549902de74980431df2f83c9fa Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:36:00 -0700
Subject: [PATCH 66/86] Create Faux Stacks(20).md

---
 Leetcode Workshops/Week 1/Faux Stacks(20).md | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)
 create mode 100644 Leetcode Workshops/Week 1/Faux Stacks(20).md

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(20).md b/Leetcode Workshops/Week 1/Faux Stacks(20).md
new file mode 100644
index 0000000..ea1f922
--- /dev/null
+++ b/Leetcode Workshops/Week 1/Faux Stacks(20).md	
@@ -0,0 +1,18 @@
+### Type: Code Steps Large ###
+
+8. The final step would be to place the smallest disk into the pole and just like that, we solved the Tower of Hanoi :)
+
+```python
+#Moving the smallest disk into our 3rd pole
+disk=sourcePole.pop()
+destPole.push(disk)
+
+print(sourcePole.stack)
+print(auxPole.stack)
+print(destPole.stack)
+
+#Result of the code
+[]
+[]
+[3, 2, 1]
+```

From bea278fd5271d3a0c7e99b04121455e8bc99796d Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:36:27 -0700
Subject: [PATCH 67/86] Rename Stacks(4).md to Stacks(13).md

---
 Leetcode Workshops/Week 1/{Stacks(4).md => Stacks(13).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Stacks(4).md => Stacks(13).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Stacks(4).md b/Leetcode Workshops/Week 1/Stacks(13).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Stacks(4).md
rename to Leetcode Workshops/Week 1/Stacks(13).md

From d6747c83078acb887f20d27461ef5b532684fd97 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:37:12 -0700
Subject: [PATCH 68/86] Rename Faux Stacks(2).md to Stacks(2).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(2).md => Stacks(2).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(2).md => Stacks(2).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(2).md b/Leetcode Workshops/Week 1/Stacks(2).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(2).md
rename to Leetcode Workshops/Week 1/Stacks(2).md

From 0a4384d55a39a531d9cdaeb4bb9fa61d83041328 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:37:29 -0700
Subject: [PATCH 69/86] Rename Faux Stacks(3).md to Stacks(3).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(3).md => Stacks(3).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(3).md => Stacks(3).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(3).md b/Leetcode Workshops/Week 1/Stacks(3).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(3).md
rename to Leetcode Workshops/Week 1/Stacks(3).md

From a0f1c4c442ade7b392c0a3db20b3340ba51b9083 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:37:45 -0700
Subject: [PATCH 70/86] Rename Faux Stacks(4).md to Stacks(4).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(4).md => Stacks(4).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(4).md => Stacks(4).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(4).md b/Leetcode Workshops/Week 1/Stacks(4).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(4).md
rename to Leetcode Workshops/Week 1/Stacks(4).md

From ca4e003a771ebd5c81862f03328ca2a47d8124c4 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:38:01 -0700
Subject: [PATCH 71/86] Rename Faux Stacks(5).md to Stacks(5).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(5).md => Stacks(5).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(5).md => Stacks(5).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(5).md b/Leetcode Workshops/Week 1/Stacks(5).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(5).md
rename to Leetcode Workshops/Week 1/Stacks(5).md

From c9ec4b3f326427c04b189252bb87ed0127802f7e Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:38:16 -0700
Subject: [PATCH 72/86] Rename Faux Stacks(6).md to Stacks(6).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(6).md => Stacks(6).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(6).md => Stacks(6).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(6).md b/Leetcode Workshops/Week 1/Stacks(6).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(6).md
rename to Leetcode Workshops/Week 1/Stacks(6).md

From 5ddef4b184b3e166e175669ce746ca0172d32184 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:38:33 -0700
Subject: [PATCH 73/86] Rename Faux Stacks(7).md to Stacks(7).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(7).md => Stacks(7).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(7).md => Stacks(7).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(7).md b/Leetcode Workshops/Week 1/Stacks(7).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(7).md
rename to Leetcode Workshops/Week 1/Stacks(7).md

From 9c40f09679621ad8da6a0b585d9e404b61aa953d Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:38:56 -0700
Subject: [PATCH 74/86] Rename Faux Stacks(8).md to Stacks(8).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(8).md => Stacks(8).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(8).md => Stacks(8).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(8).md b/Leetcode Workshops/Week 1/Stacks(8).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(8).md
rename to Leetcode Workshops/Week 1/Stacks(8).md

From 8e34a97d79f4a8d76336175e1e8d48a13c28a6e9 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:39:11 -0700
Subject: [PATCH 75/86] Rename Faux Stacks(9).md to Stacks(9).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(9).md => Stacks(9).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(9).md => Stacks(9).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(9).md b/Leetcode Workshops/Week 1/Stacks(9).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(9).md
rename to Leetcode Workshops/Week 1/Stacks(9).md

From 4016d0eb25388771b82c21aab4961239132c6554 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:39:27 -0700
Subject: [PATCH 76/86] Rename Faux Stacks(10).md to Stacks(10).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(10).md => Stacks(10).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(10).md => Stacks(10).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(10).md b/Leetcode Workshops/Week 1/Stacks(10).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(10).md
rename to Leetcode Workshops/Week 1/Stacks(10).md

From cc7a1e5f6748f348b7e35a3b84a21cbfa8365e72 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:39:43 -0700
Subject: [PATCH 77/86] Rename Faux Stacks(11).md to Stacks(11).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(11).md => Stacks(11).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(11).md => Stacks(11).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(11).md b/Leetcode Workshops/Week 1/Stacks(11).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(11).md
rename to Leetcode Workshops/Week 1/Stacks(11).md

From 87179485e2f5e7723cf47c5fd45bd788f94b1447 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:40:12 -0700
Subject: [PATCH 78/86] Rename Stacks(13).md to Stacks(12).md

---
 Leetcode Workshops/Week 1/{Stacks(13).md => Stacks(12).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Stacks(13).md => Stacks(12).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Stacks(13).md b/Leetcode Workshops/Week 1/Stacks(12).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Stacks(13).md
rename to Leetcode Workshops/Week 1/Stacks(12).md

From 5ae24f6883388115ab43daa33328fb71c4211eec Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:40:31 -0700
Subject: [PATCH 79/86] Rename Faux Stacks(13).md to Stacks(13).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(13).md => Stacks(13).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(13).md => Stacks(13).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(13).md b/Leetcode Workshops/Week 1/Stacks(13).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(13).md
rename to Leetcode Workshops/Week 1/Stacks(13).md

From 9f38088f4c612d7cbdd4782ec9b1e6e91938678a Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:40:44 -0700
Subject: [PATCH 80/86] Rename Faux Stacks(14).md to Stacks(14).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(14).md => Stacks(14).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(14).md => Stacks(14).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(14).md b/Leetcode Workshops/Week 1/Stacks(14).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(14).md
rename to Leetcode Workshops/Week 1/Stacks(14).md

From 70cf333772509c028bdc6a3d77bac60298a00b13 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:41:02 -0700
Subject: [PATCH 81/86] Rename Faux Stacks(15).md to Stacks(15).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(15).md => Stacks(15).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(15).md => Stacks(15).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(15).md b/Leetcode Workshops/Week 1/Stacks(15).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(15).md
rename to Leetcode Workshops/Week 1/Stacks(15).md

From b88f7a1c12c808960ed76dcc8f0b89d305f8bdb4 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:41:15 -0700
Subject: [PATCH 82/86] Rename Faux Stacks(16).md to Stacks(16).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(16).md => Stacks(16).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(16).md => Stacks(16).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(16).md b/Leetcode Workshops/Week 1/Stacks(16).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(16).md
rename to Leetcode Workshops/Week 1/Stacks(16).md

From 31a65046b229f81861d13865843896678cad0561 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:41:30 -0700
Subject: [PATCH 83/86] Rename Faux Stacks(17).md to Stacks(17).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(17).md => Stacks(17).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(17).md => Stacks(17).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(17).md b/Leetcode Workshops/Week 1/Stacks(17).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(17).md
rename to Leetcode Workshops/Week 1/Stacks(17).md

From a1ca485a56e3d0ca9c582d195868fe1272bd7c10 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:41:46 -0700
Subject: [PATCH 84/86] Rename Faux Stacks(18).md to Stacks(18).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(18).md => Stacks(18).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(18).md => Stacks(18).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(18).md b/Leetcode Workshops/Week 1/Stacks(18).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(18).md
rename to Leetcode Workshops/Week 1/Stacks(18).md

From 40a33a05ea30592cf6320c51cdcdd39e3bfa2346 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:42:01 -0700
Subject: [PATCH 85/86] Rename Faux Stacks(19).md to Stacks(19).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(19).md => Stacks(19).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(19).md => Stacks(19).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(19).md b/Leetcode Workshops/Week 1/Stacks(19).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(19).md
rename to Leetcode Workshops/Week 1/Stacks(19).md

From 7a5bbf8914b8261f9096af26ac92b08b281473f3 Mon Sep 17 00:00:00 2001
From: Jeffrey Ugochukwu <44630324+JeffTheAggie@users.noreply.github.com>
Date: Thu, 19 Mar 2020 18:42:14 -0700
Subject: [PATCH 86/86] Rename Faux Stacks(20).md to Stacks(20).md

---
 Leetcode Workshops/Week 1/{Faux Stacks(20).md => Stacks(20).md} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Leetcode Workshops/Week 1/{Faux Stacks(20).md => Stacks(20).md} (100%)

diff --git a/Leetcode Workshops/Week 1/Faux Stacks(20).md b/Leetcode Workshops/Week 1/Stacks(20).md
similarity index 100%
rename from Leetcode Workshops/Week 1/Faux Stacks(20).md
rename to Leetcode Workshops/Week 1/Stacks(20).md