diff --git a/README.md b/README.md
index 34ff2ee..04dcc15 100644
--- a/README.md
+++ b/README.md
@@ -8,7 +8,7 @@
 
 Whilst studying in university, I had the opportunity to study [2040S - Data Structures & Algorithms](https://www.comp.nus.edu.sg/~stevenha/cs2040s.html), which sparked my curiosity in how different hashmaps implementations resolve hash collisions (i.e linear probing, chaining using linked lists). 
 
-Each approach has its own tradeoffs, but we were taught generally these approaches booasted the same asymptotic time complexity - theoretically at least. I wanted to put such claims to the test - to test if these approaches do translate to similar real-world performance
+Each approach has its own tradeoffs, but we were taught generally these approaches boasted the same asymptotic time complexity - theoretically at least. I wanted to put such claims to the test - to test if these approaches do translate to similar real-world performance
 
 
 ## Example