summaryrefslogtreecommitdiff
path: root/src/01/06/README.md
diff options
context:
space:
mode:
Diffstat (limited to 'src/01/06/README.md')
-rw-r--r--src/01/06/README.md7
1 files changed, 4 insertions, 3 deletions
diff --git a/src/01/06/README.md b/src/01/06/README.md
index ceab17a..f288e0f 100644
--- a/src/01/06/README.md
+++ b/src/01/06/README.md
@@ -1,13 +1,14 @@
-# Learning Profile for Assignment #1 - Question #1b - Computer Science 272: Data Structures and Algorithms
+# Learning Profile for Assignment #1 - Question #6 - Computer Science 272: Data Structures and Algorithms
Name: Mo Khan
Student ID: 3431709
1. Problem Statement:
-Implement the stack methods `push(x)` and `pop()` using two queues.
+Design and implement a MinStack data structure that can store comparable elements and supports the stack operations `push(x)`, `pop()`, and `size()`,
+as well as the `min()` operation, which returns the minimum value currently stored in the data structure.
-Analyze the running time of the push(x) and pop() operations based on this implementation.
+All operations should run in constant time.
2. Description of the Code:
3. Errors and Warnings: