summaryrefslogtreecommitdiff
path: root/exercises/hashmaps
diff options
context:
space:
mode:
authorAli Afsharzadeh <afsharzadeh8@gmail.com>2023-03-30 19:53:22 +0330
committerAli Afsharzadeh <afsharzadeh8@gmail.com>2023-03-30 19:53:22 +0330
commit382e16eb7ea66cddc4860f4b19453b031a2a8a8a (patch)
tree4867f505b36ed69381a294b58d056cd9e92b8439 /exercises/hashmaps
parent362c1b0d113ad9a5bd4d1dee8086757efd060785 (diff)
feat(docs): add markdown linter for exercises README.md files
Diffstat (limited to 'exercises/hashmaps')
-rw-r--r--exercises/hashmaps/README.md3
1 files changed, 2 insertions, 1 deletions
diff --git a/exercises/hashmaps/README.md b/exercises/hashmaps/README.md
index 30471cf..80ec144 100644
--- a/exercises/hashmaps/README.md
+++ b/exercises/hashmaps/README.md
@@ -1,6 +1,7 @@
# 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