diff --git a/src/main/java/datastructures/dictionaries/ChainingHashTable.java b/src/main/java/datastructures/dictionaries/ChainingHashTable.java
index c0ca6973003e92d820cdf2dedec3aea7c8c1f13f..aa068edeff0bd7e6dc318f52210b1dca42894d9e 100644
--- a/src/main/java/datastructures/dictionaries/ChainingHashTable.java
+++ b/src/main/java/datastructures/dictionaries/ChainingHashTable.java
@@ -9,17 +9,17 @@ import java.util.Iterator;
 import java.util.function.Supplier;
 
 /**
- * 1. You must implement a generic chaining hashtable. You may not
+ * - You must implement a generic chaining hashtable. You may not
  * restrict the size of the input domain (i.e., it must accept
  * any key) or the number of inputs (i.e., it must grow as necessary).
- * 3. Your HashTable should rehash as appropriate (use load factor as
+ * - Your HashTable should rehash as appropriate (use load factor as
  * shown in class!).
- * 5. HashTable should be able to resize its capacity to prime numbers for more
+ * - HashTable should be able to resize its capacity to prime numbers for more
  * than 200,000 elements. After more than 200,000 elements, it should
  * continue to resize using some other mechanism.
- * 6. You should use the prime numbers in the given PRIME_SIZES list to resize
+ * - You should use the prime numbers in the given PRIME_SIZES list to resize
  * your HashTable with prime numbers.
- * 7. When implementing your iterator, you should NOT copy every item to another
+ * - When implementing your iterator, you should NOT copy every item to another
  * dictionary/list and return that dictionary/list's iterator.
  */
 public class ChainingHashTable<K, V> extends DeletelessDictionary<K, V> {