From ce20a7a83b389b054512ffa187117bdc6da37312 Mon Sep 17 00:00:00 2001
From: Wojciech Rok <58606210+tshmieldev@users.noreply.github.com>
Date: Mon, 20 Oct 2025 00:33:53 +0200
Subject: [PATCH] Fix typo in README regarding hash table principles

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

diff --git a/01-introduction/README.md b/01-introduction/README.md
index 2aea1bc..34666f0 100644
--- a/01-introduction/README.md
+++ b/01-introduction/README.md
@@ -14,7 +14,7 @@ index, and use the index to find it in the array.
 Array indexing has algorithmic complexity `O(1)`, making hash tables fast at
 storing and retrieving data.
 
-Our hash table will map string keys to string values, but the principals
+Our hash table will map string keys to string values, but the principles
 given here are applicable to hash tables which map arbitrary key types to
 arbitrary value types. Only ASCII strings will be supported, as supporting
 unicode is non-trivial and out of scope of this tutorial.