Merge branch 'main' of github.com:4ndrelim/data-structures-and-algorithms

Author: 4ndrelim

.idea/workspace.xml

@@ -0,0 +1,19 @@
+# Double Ended Queue (Deque)
+
+![Deque](https://media.geeksforgeeks.org/wp-content/uploads/anod.png)
+
+*Source: GeeksForGeeks*
+
+Deque is a variant of queue where elements can be removed or added from the head and tail of the queue.
+Deque could come in handy when trying to solve sliding window problems. This means it neither follows a fixed FIFO
+or LIFO order but rather can utilise either orders flexibly.
+
+A deque can be implemented in multiple ways, using doubly linked lists, arrays or two stacks.
+
+## Analysis
+Much like a queue, deque operations involves the head / tail, resulting in *O(1)* complexity for most operations.
+
+## Notes
+Just like a queue, a monotonic deque could also be created to solve more specific sliding window problems.
+
+

src/main/java/dataStructures/queue/Deque.java renamed to src/main/java/dataStructures/queue/Deque/Deque.java

@@ -18,7 +18,7 @@ A [stack](../stack/README.md) is a queue with operations conducted in an opposit
 
 As a queue only interacts with either the first or last element regardless during its operations,
 it only needs to keep the pointers of the two element at hand, which is constantly updated as more
-elements are removed / added. This allows stack operations to only incur a *O(1)* time complexity.
+elements are removed / added. This allows queue operations to only incur a *O(1)* time complexity.
 
 ## Notes
 
@@ -38,31 +38,3 @@ In the context of ordered operations, the lookup is only restricted to the first
 Hence, there is not much advantage in using a array, which only has a better lookup speed (*O(1)* time complexity)
 to implement a queue. Especially when using a linked list to construct your queue
 would allow you to grow or shrink the queue as you wish.
-
-### Queue Variants
-
-These are some variants of queue that are commonly used.
-
-#### Double Ended Queue (Deque)
-
-![Deque](https://media.geeksforgeeks.org/wp-content/uploads/anod.png)
-
-*Source: GeeksForGeeks*
-
-Deque is a variant of queue where elements can be removed or added from the head and tail of the queue.
-Deque could come in handy when trying to solve sliding window problems.
-
-A deque can be implemented in multiple ways, using doubly linked lists, arrays or two stacks.
-
-#### Monotonic Queue
-
-This is a variant of queue where elements within the queue are either strictly increasing or decreasing.
-Monotonic queues are often implemented with a deque.
-
-Within a increasing monotonic queue, any element that is smaller than the current minimum is removed.
-Within a decreasing monotonic queue, any element that is larger than the current maximum is removed.
-
-It is worth mentioning that the most elements added to the monotonic queue would always be in a 
-increasing / decreasing order,
-hence, we only need to compare down the monotonic queue from the back when adding new elements.
-

src/main/java/dataStructures/queue/Deque/README.md

@@ -0,0 +1,15 @@
+# Monotonic Queue
+
+This is a variant of queue where elements within the queue are either strictly increasing or decreasing.
+Monotonic queues are often implemented with a deque.
+
+Within a increasing monotonic queue, any element that is smaller than the current minimum is removed.
+Within a decreasing monotonic queue, any element that is larger than the current maximum is removed.
+
+It is worth mentioning that the most elements added to the monotonic queue would always be in a
+increasing / decreasing order,
+hence, we only need to compare down the monotonic queue from the back when adding new elements.
+
+## Operation Orders
+Just like a queue, a monotonic queue mainly has *O(1)* operations, 
+which is unique given that it ensures a certain order, which usually incurs operations of a higher complexity.