11 commits

Author	SHA1	Message	Date
vincenterc	ac5922d17e	docs(exercises): add information for collections ... Add additional further information for collections	2021-05-19 07:30:59 +08:00
Zerotask	249ad44cc0	docs(exercises): updated all exercises readme files ... all exercises readme files now have a unified structure and a description	2021-04-23 19:54:31 +02:00
Pete Pavlovski	72aaa15e6a	fix(hashmap2): Update incorrect assertion (#660) ... The test description says "at least five types of fruit", but the test itself is checking for exactly five types of fruit, which was a bit misleading for newcomers like me :) A simple change from "==" to ">=" should do the trick and successfully check for the "at least" condition.	2021-04-20 11:15:49 +02:00
Abdou Seck	f2ad3a6a0b	Merge pull request #697 from WowSuchRicky/main ... Rename 'Lichi' to 'Lychee' in the fruit example	2021-04-13 10:40:07 -04:00
WowSuchRicky	b790bafc02	Rename lichi to lychee in the fruit example	2021-04-09 14:08:02 -07:00
Mickael Fortunato	ab9995e76e	doc: Update collections exercises instruction to match the standard naming	2021-03-18 19:11:15 +01:00
Mickael Fortunato	bef39b1259	fix(collections): Naming exercises for vectors and hashmap	2021-03-18 19:11:04 +01:00
Pascal H	3bce2ef8d6	chore: clarify collections documentation ... C++ `map` is more like BTreeMap. `unordered_map` in C++(11) is the equivalent of `HashMap` in Rust. (+ additional like for references).	2021-03-15 09:14:12 +01:00
Jacob Tinkhauser	9b6c629397	fix(vec1): Have test compare every element in a and v ... The previous test would stop comparing elements in array a and vec v upon reaching the last element of either. This resulted in the test passing even if v did not contain all the elements in a. This change to the test fixes that bug and should only pass if all the elements in a and v are present and equal.	2020-11-29 01:35:14 +00:00
sazid	633c00cf80	feat: Add HashMap exercises	2020-10-31 01:11:04 +06:00
sazid	0c12fa31c5	feat: Add Vec exercises	2020-10-31 01:10:49 +06:00