adding notes
This commit is contained in:
@@ -86,4 +86,4 @@ Explanation: The longest consecutive elements sequence is [0, 1, 2, 3, 4, 5, 6,
|
||||
|
||||
**To complete this checkpoint**: Show a TA your program and the test results.
|
||||
|
||||
**Note**, checkpoint 3 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 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.
|
||||
|
||||
Reference in New Issue
Block a user