Toggle navigation
Net Ninja Pro
All Courses
Community
YouTube Channel
Login
Sign Up
Autoplay
Autocomplete
Previous Lecture
Complete and continue
Foundations of Algorithms Masterclass
Introduction to Algorithms
1 - Introduction (3:20)
2 - What is an Algorithm? (10:35)
3 - Using Pseudocode to Help Solve Problems (6:27)
4 - VS Code Setup & Course Files (2:37)
Algorithm Efficiency & Big O Notation
5 - Introduction to Time Complexity (6:08)
6 - Introduction to Big O Notation (3:41)
7 - Constant Time Complexity (5:51)
8 - Linear Time Complexity (4:00)
9 - Quadratic Time (6:41)
10 - CHALLENGE - Time Complexity Quiz (1:38)
11 - SOLUTION - Time Complexity Quiz (7:02)
12 - Logarithmic Time (9:58)
13 - CHALLENGE - Only Positive Numbers (1:46)
14 - SOLUTION - Only Positive Numbers (4:12)
15 - CHALLENGE - Staircase Problem (5:04)
16 - SOLUTION - Staircase Problem (12:01)
17 - Arrays & Objects (4:54)
18 - Space Complexity (3:27)
Recursion
19 - Introduction to Recursion (5:20)
20 - ASIDE - The Call Stack (7:05)
21 - Recursion Example (8:24)
22 - CHALLENGE - Recursive Fibonacci (2:05)
23 - SOLUTION - Recursive Fibonacci (5:47)
24 - Time Complexity of Recursive Algorithms (3:13)
25 - Introduction to Memoization (2:13)
26 - Adding Memoization to a Recursive Algorithm (8:47)
27 - CHALLENGE - Adding Memoization to the Staircase Problem (0:29)
28 - SOLUTION - Adding Memoization to the Staircase Problem (2:12)
29 - Space Complexity with Recursion (2:15)
Search Algorithms
31 - Linear Search Theory (1:22)
30 - Introduction to Search Algorithms (1:49)
32 - Linear Search Implementation (5:31)
33 - Binary Search Theory (2:44)
34 - Binary Search Implementation (9:19)
35 - CHALLENGE - Recursive Binary Search (2:17)
36 - SOLUTION - Recursive Binary Search (4:21)
Sorting Algorithms
37 - Introduction to Sorting (1:38)
38 - Bubble Sort Theory (4:08)
39 - Bubble Sort Implementation (7:23)
40 - CHALLENGE - Optimizing Bubble Sort (3:00)
41 - SOLUTION - Optimizing Bubble Sort (4:01)
42 - Selection Sort Theory (2:49)
43 - CHALLENGE - Selection Sort Implementation (2:14)
44 - SOLUTION - Selection Sort Implementation (8:40)
45 - Merge Sort Theory (4:12)
46 - Merging Two Arrays Together (11:47)
47 - CHALLENGE - Merge Sort Implementation (2:32)
48 - SOLUTION - Merge Sort Implementation (9:52)
The Algorithm Solver's Toolbelt
49 - Divide & Conquer (8:55)
50 - Dynamic Programming (12:15)
51 - Frequency Counting (8:27)
52 - Multiple Pointers (5:35)
53 - Sliding Window (9:50)
Algorithm Challenges
54 - Challenges Introduction (1:43)
55 - CHALLENGE - Greatest Common Divisor (5:02)
56 - SOLUTION - Greatest Common Divisor (6:06)
57 - CHALLENGE - Cartesian Product (1:38)
58 - SOLUTION - Cartesian Product (3:48)
59 - CHALLENGE - Palindromes (1:40)
60 - SOLUTION - Palindromes (3:23)
61 - CHALLENGE - Longest Substring (2:38)
62 - SOLUTION - Longest Substring (8:27)
63 - CHALLENGE - Minimum Coin Change Problem (4:32)
64 - SOLUTION - Minimum Coin Change Problem (11:36)
Wrap Up (0:41)
43 - CHALLENGE - Selection Sort Implementation
Lecture content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock
