fix(book/map): fix typo on maps space complexity

Author: amejiarosario

book/content/part03/hashmap.asc

@@ -301,7 +301,7 @@ Hash Map it’s very optimal for searching values by key in constant time *O(1)*
 .2+.^s| Data Structure 2+^s| Searching By .2+^.^s| Insert .2+^.^s| Delete .2+^.^s| Space Complexity
 ^|_Index/Key_ ^|_Value_
 | Hash Map (naïve) ^|O(n) ^|O(n) ^|O(n) ^|O(n) ^|O(n)
-| Hash Map (optimized) ^|O(1)* ^|O(n) ^|O(1)* ^|O(1)* ^|O(1)*
+| Hash Map (optimized) ^|O(1) ^|O(n) ^|O(1)* ^|O(1) ^|O(n)
 |===
 {empty}* = Amortized run time. E.g. rehashing might affect run time.
 // end::table[]