CourseClub Me Coursera - Data Structures

1. 01_basic-data-structures/02_arrays-and-linked-lists/01_arrays.mp465.14MB
2. 01_basic-data-structures/02_arrays-and-linked-lists/02_singly-linked-lists.mp478.49MB
3. 01_basic-data-structures/02_arrays-and-linked-lists/03_doubly-linked-lists.mp441.58MB
4. 01_basic-data-structures/03_stacks-and-queues/01_stacks.mp488.7MB
5. 01_basic-data-structures/03_stacks-and-queues/02_queues.mp411.48MB
6. 01_basic-data-structures/04_trees/01_trees.mp498.2MB
7. 01_basic-data-structures/04_trees/02_tree-traversal.mp417.24MB
8. 02_dynamic-arrays-and-amortized-analysis/01_dynamic-arrays-and-amortized-analysis/01_dynamic-arrays.mp413.75MB
9. 02_dynamic-arrays-and-amortized-analysis/01_dynamic-arrays-and-amortized-analysis/02_amortized-analysis-aggregate-method.mp410.01MB
10. 02_dynamic-arrays-and-amortized-analysis/01_dynamic-arrays-and-amortized-analysis/03_amortized-analysis-bankers-method.mp411.32MB
11. 02_dynamic-arrays-and-amortized-analysis/01_dynamic-arrays-and-amortized-analysis/04_amortized-analysis-physicists-method.mp411.88MB
12. 02_dynamic-arrays-and-amortized-analysis/01_dynamic-arrays-and-amortized-analysis/05_amortized-analysis-summary.mp44.69MB
13. 03_priority-queues-and-disjoint-sets/01_priority-queues-introduction/01_introduction.mp416.11MB
14. 03_priority-queues-and-disjoint-sets/01_priority-queues-introduction/02_naive-implementations-of-priority-queues.mp415.93MB
15. 03_priority-queues-and-disjoint-sets/02_priority-queues-heaps/01_binary-trees.mp43.66MB
16. 03_priority-queues-and-disjoint-sets/02_priority-queues-heaps/03_basic-operations.mp433.18MB
17. 03_priority-queues-and-disjoint-sets/02_priority-queues-heaps/04_complete-binary-trees.mp418.62MB
18. 03_priority-queues-and-disjoint-sets/02_priority-queues-heaps/05_pseudocode.mp416.15MB
19. 03_priority-queues-and-disjoint-sets/03_priority-queues-heap-sort/01_heap-sort.mp424.7MB
20. 03_priority-queues-and-disjoint-sets/03_priority-queues-heap-sort/02_building-a-heap.mp418.63MB
21. 03_priority-queues-and-disjoint-sets/03_priority-queues-heap-sort/03_final-remarks.mp410.46MB
22. 03_priority-queues-and-disjoint-sets/04_disjoint-sets-naive-implementations/01_overview.mp416.96MB
23. 03_priority-queues-and-disjoint-sets/04_disjoint-sets-naive-implementations/02_naive-implementations.mp422.4MB
24. 03_priority-queues-and-disjoint-sets/05_disjoint-sets-efficient-implementation/01_trees-for-disjoint-sets.mp416.05MB
25. 03_priority-queues-and-disjoint-sets/05_disjoint-sets-efficient-implementation/02_union-by-rank.mp417.66MB
26. 03_priority-queues-and-disjoint-sets/05_disjoint-sets-efficient-implementation/03_path-compression.mp412.03MB
27. 03_priority-queues-and-disjoint-sets/05_disjoint-sets-efficient-implementation/04_analysis-optional.mp435.47MB
28. 04_hash-tables/01_introduction-direct-addressing-and-chaining/01_applications-of-hashing.mp45.11MB
29. 04_hash-tables/01_introduction-direct-addressing-and-chaining/02_analysing-service-access-logs.mp410.85MB
30. 04_hash-tables/01_introduction-direct-addressing-and-chaining/03_direct-addressing.mp410.43MB
31. 04_hash-tables/01_introduction-direct-addressing-and-chaining/04_list-based-mapping.mp416.81MB
32. 04_hash-tables/01_introduction-direct-addressing-and-chaining/05_hash-functions.mp47.03MB
33. 04_hash-tables/01_introduction-direct-addressing-and-chaining/06_chaining-scheme.mp48.17MB
34. 04_hash-tables/01_introduction-direct-addressing-and-chaining/07_chaining-implementation-and-analysis.mp47.47MB
35. 04_hash-tables/01_introduction-direct-addressing-and-chaining/08_hash-tables.mp411.16MB
36. 04_hash-tables/02_hash-functions/01_phone-book-problem.mp48.72MB
37. 04_hash-tables/02_hash-functions/02_phone-book-problem-continued.mp414.2MB
38. 04_hash-tables/02_hash-functions/03_universal-family.mp421.08MB
39. 04_hash-tables/02_hash-functions/04_hashing-integers.mp420.02MB
40. 04_hash-tables/02_hash-functions/05_proof-upper-bound-for-chain-length-optional.mp417.72MB
41. 04_hash-tables/02_hash-functions/06_proof-universal-family-for-integers-optional.mp424.89MB
42. 04_hash-tables/02_hash-functions/07_hashing-strings.mp420.73MB
43. 04_hash-tables/02_hash-functions/08_hashing-strings-cardinality-fix.mp415.11MB
44. 04_hash-tables/03_searching-patterns/01_search-pattern-in-text.mp414.32MB
45. 04_hash-tables/03_searching-patterns/02_rabin-karps-algorithm.mp419.89MB
46. 04_hash-tables/03_searching-patterns/03_optimization-precomputation.mp417.94MB
47. 04_hash-tables/03_searching-patterns/04_optimization-implementation-and-analysis.mp413.04MB
48. 04_hash-tables/04_distributed-hash-tables-optional/01_instant-uploads-and-storage-optimization-in-dropbox.mp421.91MB
49. 04_hash-tables/04_distributed-hash-tables-optional/02_distributed-hash-tables.mp426.68MB
50. 05_binary-search-trees/01_binary-search-trees/01_introduction.mp411.99MB
51. 05_binary-search-trees/01_binary-search-trees/02_search-trees.mp47.91MB
52. 05_binary-search-trees/01_binary-search-trees/03_basic-operations.mp414.53MB
53. 05_binary-search-trees/01_binary-search-trees/04_balance.mp47.22MB
54. 05_binary-search-trees/02_avl-trees/01_avl-trees.mp48.43MB
55. 05_binary-search-trees/02_avl-trees/02_avl-tree-implementation.mp412.59MB
56. 05_binary-search-trees/02_avl-trees/03_split-and-merge.mp413.84MB
57. 06_binary-search-trees-2/01_applications/01_applications.mp415.86MB
58. 06_binary-search-trees-2/02_splay-trees/01_splay-trees-introduction.mp410.73MB
59. 06_binary-search-trees-2/02_splay-trees/02_splay-trees-implementation.mp413.88MB
60. 06_binary-search-trees-2/02_splay-trees/03_optional-splay-trees-analysis.mp417.82MB