Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Algorithmic Problems in Java
Introduction
1. Introduction (1:36)
Recursion
3. Recursion introduction (8:43)
4. Adding numbers - iteration vs recursion (5:04)
5. House building problem (3:59)
6. Factorial function (7:13)
7. Euclidean algorithm - greatest common divisor (2:29)
8. Linear and binary search introduction (3:30)
9. Linear and binary search implementation (7:48)
10. Towers of Hanoi problem introduction (6:00)
11. Tower of Hanoi problem implementation (7:26)
Selection Algorithms
12. Selection algorithms introduction (5:50)
13. Quickselect introduction - Hoare algorithm (7:39)
14. Quickselect simulation (8:04)
15. Quickselect implementation (8:26)
16. Advanced selection - median of medians, introselect (7:21)
17. Online selection - the secretary problem (4:58)
Backtracking
18. Backtracking introduction (6:06)
19. N-queens problem introduction (10:10)
20. N-queens problem implementation I (9:21)
21. N-queens problem implementation II (6:15)
22. Hamiltonian cycle introduction (9:01)
23. Hamiltonian cycle illustration (5:55)
24. Hamiltonian cycle implementation I (10:16)
25. Hamiltonian cycle implementation II (7:01)
26. Coloring problem introduction (9:12)
27. Coloring problem implementation I (7:17)
28. Coloring problem implementation II (5:24)
29. Knight's tour introduction (4:06)
30. Knight's tour implementation I (10:32)
31. Knight's tour implementation II (4:48)
32. Maze problem introduction (3:13)
33. Maze problem implementation I (7:21)
34. Maze problem implementation II (4:09)
35. Sudoku introduction (6:29)
36. Sudoku implementation I (8:36)
37. Sudoku implementation II (3:27)
38. NP-complete problems (3:51)
Dynamic Programming
39. Dynamic programming introduction (3:22)
40. Fibonacci numbers introduction (5:34)
41. Fibonacci numbers implementation (7:57)
42. Knapsack problem introduction (12:49)
43. Knapsack problem example (13:18)
44. Knapsack problem implementation I (8:07)
45. Knapsack problem implementation II (4:26)
46. Coin change problem introduction (9:18)
47. Coin change problem example (6:04)
48. Coin change problem implementation (11:40)
49. Rod cutting problem introduction (5:23)
50. Rod cutting problem example (8:14)
51. Rod cutting problem implementation (8:44)
52. Subset sum problem introduction (6:30)
53. Subset sum problem example (8:53)
54. Subset sum problem implementation (9:04)
Other Algorithmic Problems
55. Bin packing problem introduction (5:47)
56. Bin packing problem implementation (6:52)
57. Closest pair of points problem introduction (8:50)
58. Closest pair of points problem implementatio (9:49)
8. Linear and binary search introduction
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock