|
@@ -606,8 +606,8 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|
|
- [ ] [Data Structures (video)](https://www.coursera.org/learn/data-structures/home/week/4)
|
|
- [ ] [Data Structures (video)](https://www.coursera.org/learn/data-structures/home/week/4)
|
|
|
- [ ] [Phone Book Problem (video)](https://www.coursera.org/lecture/data-structures/phone-book-problem-NYZZP)
|
|
- [ ] [Phone Book Problem (video)](https://www.coursera.org/lecture/data-structures/phone-book-problem-NYZZP)
|
|
|
- [ ] distributed hash tables:
|
|
- [ ] distributed hash tables:
|
|
|
- - [Instant Uploads And Storage Optimization In Dropbox (video)](https://www.coursera.org/learn/data-structures/lecture/DvaIb/instant-uploads-and-storage-optimization-in-dropbox)
|
|
|
|
|
- - [Distributed Hash Tables (video)](https://www.coursera.org/learn/data-structures/lecture/tvH8H/distributed-hash-tables)
|
|
|
|
|
|
|
+ - [Instant Uploads And Storage Optimization In Dropbox (video)](https://www.coursera.org/lecture/data-structures/instant-uploads-and-storage-optimization-in-dropbox-DvaIb)
|
|
|
|
|
+ - [Distributed Hash Tables (video)](https://www.coursera.org/lecture/data-structures/distributed-hash-tables-tvH8H)
|
|
|
|
|
|
|
|
- [ ] implement with array using linear probing
|
|
- [ ] implement with array using linear probing
|
|
|
- hash(k, m) - m is size of hash table
|
|
- hash(k, m) - m is size of hash table
|
Andy