From d353d1071a1888f391348dbd647889b79fd23266 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Ren=C3=A9=20Ribaud?= Date: Fri, 13 Dec 2024 01:01:00 +0100 Subject: [PATCH] Fix a small typo (#69) --- challenges/animal-sanctuary-registry/description.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/challenges/animal-sanctuary-registry/description.md b/challenges/animal-sanctuary-registry/description.md index 2e3e00c..423832a 100644 --- a/challenges/animal-sanctuary-registry/description.md +++ b/challenges/animal-sanctuary-registry/description.md @@ -2,7 +2,7 @@ Hashmaps are a powerful data structure that allow you to store **key-value pairs**. In Rust, the `HashMap` type is provided that uses the a **hashing algorithm** called **SipHash** to store keys and values in a way that allows for **fast and secure** lookups. Think of them as a dictionary in Python or an object in JavaScript. -In this challenge, we want to build a sanctuary registry that allows us to manage animals in different sections of the sanctuary. We'll use a `HashMap` to store the sections as keys and a `Vec` to store the animals in each section. Each key is a section name `String` and each value is a list of animals in that section `Vev`. +In this challenge, we want to build a sanctuary registry that allows us to manage animals in different sections of the sanctuary. We'll use a `HashMap` to store the sections as keys and a `Vec` to store the animals in each section. Each key is a section name `String` and each value is a list of animals in that section `Vec`. ## Task