From c8f2e3a9c89c83a8217e042a5fe6dc1020a8b4ed Mon Sep 17 00:00:00 2001
From: Jidong Xiao <xiaoj8@rpi.edu>
Date: Wed, 3 Apr 2024 10:37:18 -0400
Subject: [PATCH] revising cp3

---
 labs/12_hash_tables/README.md | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/labs/12_hash_tables/README.md b/labs/12_hash_tables/README.md
index 7cc6357..8dc3689 100644
--- a/labs/12_hash_tables/README.md
+++ b/labs/12_hash_tables/README.md
@@ -60,7 +60,8 @@ Complete the *isHappy* function using separate chaining. Do not use any of these
 
 **To complete this checkpoint**: Show a TA these additions and the test output.
 
-## Checkpoint 3,4,5,6: Separate Chaining Hash Table (Yes, it's Checkpoint 3,4,5,6, as there are 3 extra credits for making this program work.)
+<!--## Checkpoint 3,4,5,6: Separate Chaining Hash Table (Yes, it's Checkpoint 3,4,5,6, as there are 3 extra credits for making this program work.)-->
+## Checkpoint 3
 
 *estimate: 30-40 minutes*
 
@@ -86,4 +87,4 @@ Explanation: The longest consecutive elements sequence is [0, 1, 2, 3, 4, 5, 6,
 
 **To complete checkpoint (3,4,5,6)**: Show a TA your program and the test results.
 
-**Note**: checkpoint (3,4,5,6) is very challenging, if you can't get it work during your lab period, make sure you understand it completely after the lab period, because one of the four problems on Test 3, will be about separate-chaining-based hash tables. It's 100% certain.
+<!--**Note**: checkpoint (3,4,5,6) is very challenging, if you can't get it work during your lab period, make sure you understand it completely after the lab period, because one of the four problems on Test 3, will be about separate-chaining-based hash tables. It's 100% certain.-->