check point 3

This commit is contained in:
Jidong Xiao
2024-04-03 10:41:46 -04:00
parent d716765266
commit fc3a0169d3
2 changed files with 2 additions and 91 deletions

View File

@@ -85,6 +85,7 @@ Output: 9
Explanation: The longest consecutive elements sequence is [0, 1, 2, 3, 4, 5, 6, 7, 8]. Therefore its length is 9.
```
**To complete checkpoint (3,4,5,6)**: Show a TA your program and the test results.
**To complete this checkpoint**: Show a TA your program and the test results.
<!--**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.-->