diff --git a/src/main/java/datastructures/dictionaries/ChainingHashTable.java b/src/main/java/datastructures/dictionaries/ChainingHashTable.java
index f3ae0a116d2715c0955e6673f46d052e01accc1d..ad33b7bcc1d07baaaffe0dbc7c2d077ef0feef7c 100644
--- a/src/main/java/datastructures/dictionaries/ChainingHashTable.java
+++ b/src/main/java/datastructures/dictionaries/ChainingHashTable.java
@@ -13,8 +13,7 @@ import java.util.function.Supplier;
  *   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).
  *
- * - ChainingHashTable should rehash as appropriate (use load factor as
- *   shown in class!).
+ * - ChainingHashTable should rehash as appropriate (use load factor as shown in lecture!).
  *
  * - ChainingHashTable must resize its capacity into prime numbers via given PRIME_SIZES list.
  *   Past this, it should continue to resize using some other mechanism (primes not necessary).