From 86b7f9ce180c95e836451fdab86c253e3b667ac0 Mon Sep 17 00:00:00 2001
From: bt3gl <138340846+bt3gl-cryptographer@users.noreply.github.com>
Date: Tue, 8 Aug 2023 17:47:37 -0700
Subject: [PATCH] Update README.md

---
 stacks/README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/stacks/README.md b/stacks/README.md
index 95996b5..5b877c9 100644
--- a/stacks/README.md
+++ b/stacks/README.md
@@ -5,7 +5,7 @@
 
 * stacks are **last in, first out** (LIFO) abstract structures, where the newest element is first one to be removed from the structure.
 
-* a stack support `push` and `pop` at `O(1)`, and they be implmented with arrays or singly linked list.
+* a stack support `push` and `pop` at `O(1)`, and they be implemented with arrays or singly linked list.
   
 * stacks are useful in **depth-first search** algorithms, where you can push temp data as you recurse, and remove them from the (memory or data structure) stack as you backtrace.