summaryrefslogtreecommitdiff
path: root/src/01/06/README.md
diff options
context:
space:
mode:
authormo khan <mo.khan@gmail.com>2020-07-05 11:55:53 -0600
committermo khan <mo.khan@gmail.com>2020-07-05 11:55:53 -0600
commit915320dd77fe495fe38f805eb29241eb49a49024 (patch)
treea9fe23753d103cb2f8dd106911e3ad39f78afd2e /src/01/06/README.md
parent080c0e2eaec96b2627b37c6eb9e5e34e6e65ee04 (diff)
Create program to showcase a min stack
Diffstat (limited to 'src/01/06/README.md')
-rw-r--r--src/01/06/README.md10
1 files changed, 5 insertions, 5 deletions
diff --git a/src/01/06/README.md b/src/01/06/README.md
index f288e0f..c02bf45 100644
--- a/src/01/06/README.md
+++ b/src/01/06/README.md
@@ -3,14 +3,14 @@
Name: Mo Khan
Student ID: 3431709
-1. Problem Statement:
+## Problem Statement
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.
All operations should run in constant time.
-2. Description of the Code:
-3. Errors and Warnings:
-4. Sample Input and Output:
-5. Discussion:
+## Description of the Code
+## Errors and Warnings
+## Sample Input and Output
+## Discussion