diff --git a/lectures/20_hash_tables_I/README.md b/lectures/20_hash_tables_I/README.md
index 0866b9e..23c1409 100644
--- a/lectures/20_hash_tables_I/README.md
+++ b/lectures/20_hash_tables_I/README.md
@@ -2,7 +2,7 @@
 
 ## Today’s Lecture
 
-- Hash Tables, Hash Functions, and Collision Resolution (leetcode 1, 705, 706)
+- Hash Tables, Hash Functions, and Collision Resolution <!--(leetcode 1, 705, 706)-->
 - Performance of: Hash Tables vs. Binary Search Trees
 - Collision resolution: separate chaining vs open addressing
 - STL’s unordered_set (and unordered_map)