summaryrefslogtreecommitdiff
path: root/exercises/hashmaps/README.md
diff options
context:
space:
mode:
authorAlexandre ESSE <alexandre.esse.dev@gmail.com>2023-03-31 11:20:11 +0200
committerAlexandre ESSE <alexandre.esse.dev@gmail.com>2023-03-31 11:58:15 +0200
commit22bb662d3eb9efd081a5603640628bdeebab97b9 (patch)
treefb2a0b206db4626e4c39d3ca1cc2c643aa4052be /exercises/hashmaps/README.md
parent362c1b0d113ad9a5bd4d1dee8086757efd060785 (diff)
fix(exercises): remove trailing spaces
Diffstat (limited to 'exercises/hashmaps/README.md')
-rw-r--r--exercises/hashmaps/README.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/exercises/hashmaps/README.md b/exercises/hashmaps/README.md
index 30471cf..6afa04b 100644
--- a/exercises/hashmaps/README.md
+++ b/exercises/hashmaps/README.md
@@ -1,6 +1,6 @@
# Hashmaps
A *hash map* allows you to associate a value with a particular key.
-You may also know this by the names [*unordered map* in C++](https://en.cppreference.com/w/cpp/container/unordered_map),
+You may also know this by the names [*unordered map* in C++](https://en.cppreference.com/w/cpp/container/unordered_map),
[*dictionary* in Python](https://docs.python.org/3/tutorial/datastructures.html#dictionaries) or an *associative array* in other languages.
This is the other data structure that we've been talking about before, when