Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Algorithms and Data Structures in Java - Part II
Introduction
1. Introduction (1:10)
Prefix Tree - Tries
3. Prefix tree introduction - basics (9:14)
4. Prefix tree introduction - insert (5:58)
5. Prefix tree introduction - sorting (5:39)
6. Prefix tree introduction - autocomplete (5:19)
7. Prefix tree introduction - trie as a hash table (9:01)
8. Prefix tree introduction - hashing versus tries (6:47)
9. Prefix tree introduction - applications (2:05)
10. Prefix tree implementation - insert, search I (6:49)
11. Prefix tree implementation - insert, search II (8:46)
12. Prefix tree implementation - insert, search III (8:10)
13. Prefix tree implementation - as a map (6:56)
14. Prefix tree implementation - autocomplete (9:08)
15. Prefix tree implementation - sorting (2:32)
16. Longest common prefix (5:21)
17. Longest common prefix in networking (7:31)
Ternary Search Tree
18. Ternary search tree introduction - basics (6:01)
19. Ternary search tree introduction - insert (5:30)
20. Ternary search tree introduction - get (4:18)
21. Ternary search tree introduction - applications (5:05)
22. Ternary search tree implementation I (8:12)
23. Ternary search tree implementation II (5:20)
Substring Search
24. Brute-force search introduction (6:42)
25. Brute-force search implementation (7:04)
26. Boyer-Moore search introduction (6:38)
27. Boyer-Moore search example (6:40)
28. Boyer-Moore implementation I (3:24)
29. Boyer-Moore implementation II (4:55)
30. Boyer-Moore implementation III (2:06)
31. Rabin-Karp algorithm introduction (8:42)
Strings
32. Strings introduction (13:01)
33. String reversion (6:37)
34. Suffixes (5:01)
35. Prefixes (4:00)
36. Longest common prefix (5:34)
37. Longest repeated substring problem (4:04)
Basic Sorting Algorithms
38. Sorting introduction (8:02)
39. Adaptive sorting algorithms (3:05)
40. Bogo sort introduction (3:35)
41. Bogo sort implementation (6:43)
42. Sleep sort (3:08)
43. Bubble sort introduction (5:35)
44. Bubble sort implementation (5:15)
45. Selection sort introduction (6:39)
46. Selection sort implementation (4:11)
47. Insertion sort introduction (7:39)
48. Insertion sort implementation (4:49)
49. Shell sort introduction (8:14)
50. Shell sort implementation (6:46)
51. Quicksort introduction I (8:53)
52. Quicksort introduction II (7:41)
53. Quicksort implementation (6:55)
54. Merge sort introduction - divide (6:50)
55. Merge sort introduction - conquer (8:54)
56. Merge sort implementation (6:26)
57. Hybrid algorithms introduction (5:50)
58. Non-comparison based algorithms (2:27)
59. Counting sort introduction (8:06)
60. Counting sort implementation (6:42)
61. Radix sort introduction (8:43)
Data Compression
62. Run length encoding introduction (10:46)
63. Run length encoding implementation - encode (5:15)
64. Run length encoding implementation - decode (5:45)
65. Huffman encoding introduction (9:13)
66. Huffman decoding (4:05)
67. Huffman encoding implementation I - helper classes (7:27)
68. Huffman encoding implementation II - encoding (7:58)
69. Huffman encoding implementation III - testing (7:51)
70. LZW compression introduction - compression (10:27)
71. LZW compression introduction - decompression (6:53)
72. LZW implementation (9:24)
20. Ternary search tree introduction - get
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock