Algorithms and Data Structures for Beginners
Before starting the course, let’s go a little bit over what will be taught, who it is for and what you will need to succeed.
This course covers all of the fundamental data structures and algorithms required to succeed in technical interviews.
Who is this course for?
If you are someone who is a beginner, this course is for you. If you need a refresher, or are trying to switch careers, this course is also for you.
Content of the course
In technical interviews, you will be expected to code up an efficient algorithm, talk comfortably about the design, analysis and tradeoffs of a specific algorithm. Being able to succinctly perform these tasks in a timely fashion and communicate your ideas in a coherent manner is what can make the difference in thousands of dollars of compensation.
Topics Covered
- Arrays
- Linked Lists
- Recursion
- Sorting
- Binary Search
- Trees
- Backtracking
- Heap/Priority Queue
- Hashing
- Graphs
- Dynamic Programming
- Bit Manipulation
Let’s get started when you are ready.
Watch Online Algorithms and Data Structures for Beginners
# | Title | Duration |
---|---|---|
1 | 0. Introduction | 00:50 |
2 | 1. RAM | 05:51 |
3 | 2. Static Arrays | 14:36 |
4 | 3. Dynamic Arrays | 16:26 |
5 | 4. Stacks | 04:27 |
6 | 5. Singly Linked Lists | 11:50 |
7 | 6. Doubly Linked Lists | 09:31 |
8 | 7. Queues | 03:33 |
9 | 8. Factorial | 11:08 |
10 | 9. Fibonacci Sequence | 12:27 |
11 | 10. Insertion Sort | 19:27 |
12 | 11. Merge Sort | 21:49 |
13 | 12. Quick Sort | 16:44 |
14 | 13. Bucket Sort | 13:35 |
15 | 14. Search Array | 15:32 |
16 | 15. Search Range | 07:34 |
17 | 16. Binary Tree | 11:12 |
18 | 17. Binary Search Tree | 14:35 |
19 | 18. BST Insert and Remove | 21:38 |
20 | 19. Depth-First Search | 15:28 |
21 | 20. Breadth-First Search | 11:24 |
22 | 21. BST Sets and Maps | 05:50 |
23 | 22. Tree Maze | 13:59 |
24 | 23. Heap Properties | 14:07 |
25 | 24. Push and Pop | 17:44 |
26 | 25. Heapify | 14:35 |
27 | 26. Hash Usage | 10:01 |
28 | 27. Hash Implementation | 28:52 |
29 | 28. Intro to Graphs | 22:03 |
30 | 29. Matrix DFS | 21:53 |
31 | 30. Matrix BFS | 13:44 |
32 | 31. Adjacency List | 19:44 |
33 | 32. 1-Dimension DP | 20:02 |
34 | 33. 2-Dimension DP | 22:30 |
35 | 34. Bit Operations | 17:23 |