Filename | Size |
| 01 Introduction/001 Introduction-en.srt | 2.2 KB |
| 01 Introduction/001 Introduction.mp4 | 3.4 MB |
| 01 Introduction/002 Course Materials.html | 986 B |
| 02 Recursion/003 Recursion introduction-en.srt | 11.5 KB |
| 02 Recursion/003 Recursion introduction.mp4 | 21.5 MB |
| 02 Recursion/004 Adding numbers iteration vs recursion-en.srt | 6 KB |
| 02 Recursion/004 Adding numbers iteration vs recursion.mp4 | 10.7 MB |
| 02 Recursion/005 House building problem-en.srt | 4.9 KB |
| 02 Recursion/005 House building problem.mp4 | 8.7 MB |
| 02 Recursion/006 Factorial function-en.srt | 9.4 KB |
| 02 Recursion/006 Factorial function.mp4 | 16.3 MB |
| 02 Recursion/007 Euclidean algorithm - greatest common divisor-en.srt | 3.4 KB |
| 02 Recursion/007 Euclidean algorithm - greatest common divisor.mp4 | 5.1 MB |
| 02 Recursion/008 Linear and binary search introduction-en.srt | 4.9 KB |
| 02 Recursion/008 Linear and binary search introduction.mp4 | 8.1 MB |
| 02 Recursion/009 Linear and binary search implementation-en.srt | 9.3 KB |
| 02 Recursion/009 Linear and binary search implementation.mp4 | 16.5 MB |
| 02 Recursion/010 Towers of Hanoi problem introduction-en.srt | 8.5 KB |
| 02 Recursion/010 Towers of Hanoi problem introduction.mp4 | 14.1 MB |
| 02 Recursion/011 Tower of Hanoi problem implementation-en.srt | 9.4 KB |
| 02 Recursion/011 Tower of Hanoi problem implementation.mp4 | 16.6 MB |
| 03 Selection Algorithms/012 Selection algorithms introduction-en.srt | 7.9 KB |
| 03 Selection Algorithms/012 Selection algorithms introduction.mp4 | 14 MB |
| 03 Selection Algorithms/013 Quickselect introduction - Hoare algorithm-en.srt | 10.4 KB |
| 03 Selection Algorithms/013 Quickselect introduction - Hoare algorithm.mp4 | 18.2 MB |
| 03 Selection Algorithms/014 Quickselect simulation-en.srt | 11.1 KB |
| 03 Selection Algorithms/014 Quickselect simulation.mp4 | 19.1 MB |
| 03 Selection Algorithms/015 Quickselect implementation-en.srt | 9.3 KB |
| 03 Selection Algorithms/015 Quickselect implementation.mp4 | 18.2 MB |
| 03 Selection Algorithms/016 Advanced selection - median of medians introselect-en.srt | 10.8 KB |
| 03 Selection Algorithms/016 Advanced selection - median of medians introselect.mp4 | 14.9 MB |
| 03 Selection Algorithms/017 Online selection - the secretary problem-en.srt | 7.2 KB |
| 03 Selection Algorithms/017 Online selection - the secretary problem.mp4 | 10 MB |
| 04 Backtracking/018 Backtracking introduction-en.srt | 8.1 KB |
| 04 Backtracking/018 Backtracking introduction.mp4 | 14.4 MB |
| 04 Backtracking/019 N-queens problem introduction-en.srt | 14.5 KB |
| 04 Backtracking/019 N-queens problem introduction.mp4 | 22.6 MB |
| 04 Backtracking/020 N-queens problem implementation I-en.srt | 12.2 KB |
| 04 Backtracking/020 N-queens problem implementation I.mp4 | 20.9 MB |
| 04 Backtracking/021 N-queens problem implementation II-en.srt | 8.4 KB |
| 04 Backtracking/021 N-queens problem implementation II.mp4 | 14.6 MB |
| 04 Backtracking/022 Hamiltonian cycle introduction-en.srt | 11.8 KB |
| 04 Backtracking/022 Hamiltonian cycle introduction.mp4 | 21.7 MB |
| 04 Backtracking/023 Hamiltonian cycle illustration-en.srt | 7.8 KB |
| 04 Backtracking/023 Hamiltonian cycle illustration.mp4 | 13.2 MB |
| 04 Backtracking/024 Hamiltonian cycle implementation I-en.srt | 13.3 KB |
| 04 Backtracking/024 Hamiltonian cycle implementation I.mp4 | 23.2 MB |
| 04 Backtracking/025 Hamiltonian cycle implementation II-en.srt | 8.8 KB |
| 04 Backtracking/025 Hamiltonian cycle implementation II.mp4 | 17.5 MB |
| 04 Backtracking/026 Coloring problem introduction-en.srt | 13 KB |
| 04 Backtracking/026 Coloring problem introduction.mp4 | 22 MB |
| 04 Backtracking/027 Coloring problem implementation I-en.srt | 8.8 KB |
| 04 Backtracking/027 Coloring problem implementation I.mp4 | 16.4 MB |
| 04 Backtracking/028 Coloring problem implementation II-en.srt | 7.4 KB |
| 04 Backtracking/028 Coloring problem implementation II.mp4 | 13.2 MB |
| 04 Backtracking/029 Knights tour introduction-en.srt | 5.2 KB |
| 04 Backtracking/029 Knights tour introduction.mp4 | 9 MB |
| 04 Backtracking/030 Knights tour implementation I-en.srt | 12.9 KB |
| 04 Backtracking/030 Knights tour implementation I.mp4 | 24 MB |
| 04 Backtracking/031 Knights tour implementation II-en.srt | 6.3 KB |
| 04 Backtracking/031 Knights tour implementation II.mp4 | 12.3 MB |
| 04 Backtracking/032 Maze problem introduction-en.srt | 4.9 KB |
| 04 Backtracking/032 Maze problem introduction.mp4 | 6.8 MB |
| 04 Backtracking/033 Maze problem implementation I-en.srt | 8.6 KB |
| 04 Backtracking/033 Maze problem implementation I.mp4 | 16 MB |
| 04 Backtracking/034 Maze problem implementation II-en.srt | 5.2 KB |
| 04 Backtracking/034 Maze problem implementation II.mp4 | 9.6 MB |
| 04 Backtracking/035 Sudoku introduction-en.srt | 8.3 KB |
| 04 Backtracking/035 Sudoku introduction.mp4 | 16 MB |
| 04 Backtracking/036 Sudoku implementation I-en.srt | 11 KB |
| 04 Backtracking/036 Sudoku implementation I.mp4 | 20.4 MB |
| 04 Backtracking/037 Sudoku implementation II-en.srt | 4.3 KB |
| 04 Backtracking/037 Sudoku implementation II.mp4 | 10.1 MB |
| 04 Backtracking/038 NP-complete problems-en.srt | 5.3 KB |
| 04 Backtracking/038 NP-complete problems.mp4 | 9 MB |
| 05 Dynamic Programming/039 Dynamic programming introduction-en.srt | 4.5 KB |
| 05 Dynamic Programming/039 Dynamic programming introduction.mp4 | 8.6 MB |
| 05 Dynamic Programming/040 Fibonacci numbers introduction-en.srt | 7.6 KB |
| 05 Dynamic Programming/040 Fibonacci numbers introduction.mp4 | 13.4 MB |
| 05 Dynamic Programming/041 Fibonacci numbers implementation-en.srt | 9.5 KB |
| 05 Dynamic Programming/041 Fibonacci numbers implementation.mp4 | 17.7 MB |
| 05 Dynamic Programming/042 Knapsack problem introduction-en.srt | 16.4 KB |
| 05 Dynamic Programming/042 Knapsack problem introduction.mp4 | 31.2 MB |
| 05 Dynamic Programming/043 Knapsack problem example-en.srt | 16.9 KB |
| 05 Dynamic Programming/043 Knapsack problem example.mp4 | 30.1 MB |
| 05 Dynamic Programming/044 Knapsack problem implementation I-en.srt | 9 KB |
| 05 Dynamic Programming/044 Knapsack problem implementation I.mp4 | 19.2 MB |
| 05 Dynamic Programming/045 Knapsack problem implementation II-en.srt | 5.4 KB |
| 05 Dynamic Programming/045 Knapsack problem implementation II.mp4 | 11.5 MB |
| 05 Dynamic Programming/046 Coin change problem introduction-en.srt | 12.1 KB |
| 05 Dynamic Programming/046 Coin change problem introduction.mp4 | 22.3 MB |
| 05 Dynamic Programming/047 Coin change problem example-en.srt | 7.9 KB |
| 05 Dynamic Programming/047 Coin change problem example.mp4 | 13.6 MB |
| 05 Dynamic Programming/048 Coin change problem implementation-en.srt | 14.2 KB |
| 05 Dynamic Programming/048 Coin change problem implementation.mp4 | 24.8 MB |
| 05 Dynamic Programming/049 Rod cutting problem introduction-en.srt | 7.1 KB |
| 05 Dynamic Programming/049 Rod cutting problem introduction.mp4 | 12.7 MB |
| 05 Dynamic Programming/050 Rod cutting problem example-en.srt | 11.2 KB |
| 05 Dynamic Programming/050 Rod cutting problem example.mp4 | 18.9 MB |