Algorithms and Data Structures for Beginners

8h 22m 4s
English
Paid

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

  1. Arrays
  2. Linked Lists
  3. Recursion
  4. Sorting
  5. Binary Search
  6. Trees
  7. Backtracking
  8. Heap/Priority Queue
  9. Hashing
  10. Graphs
  11. Dynamic Programming
  12. Bit Manipulation

Let’s get started when you are ready.

Watch Online Algorithms and Data Structures for Beginners

Join premium to watch
Go to premium
# 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

Similar courses to Algorithms and Data Structures for Beginners

The Coding Interview Bootcamp: Algorithms + Data Structures

The Coding Interview Bootcamp: Algorithms + Data StructuresudemyStephen Grider

Category: Preparing for an interview
Duration 12 hours 52 minutes 17 seconds
Recursion, Backtracking and Dynamic Programming in Java

Recursion, Backtracking and Dynamic Programming in Javaudemy

Category: Preparing for an interview, Java
Duration 9 hours 46 minutes 17 seconds
Grokking Dynamic Programming Patterns: Coding Interviews

Grokking Dynamic Programming Patterns: Coding Interviewsudemy

Category: Preparing for an interview
Duration 32 hours 34 minutes 13 seconds
Professional Developer Resume

Professional Developer ResumeGeorge Moller

Category: Preparing for an interview
Duration
Data Science Interview Prep

Data Science Interview PrepLunarTech

Category: Preparing for an interview
Duration 1 hour 15 minutes 18 seconds
Crack the Frontend Interview with React

Crack the Frontend Interview with Reactzerotomastery.io

Category: React.js, Preparing for an interview
Duration 1 hour 6 minutes 53 seconds
Master The Behavioral Interview As A Software Engineer

Master The Behavioral Interview As A Software EngineerAlex Chiou

Category: Preparing for an interview
Duration 2 hours 46 minutes 2 seconds
Pragmatic System Design

Pragmatic System Designudemy

Category: Preparing for an interview
Duration 4 hours 28 minutes 50 seconds
Coding Interview Class (Back To Back SWE)

Coding Interview Class (Back To Back SWE)backtobackswe.com

Category: Preparing for an interview
Duration 33 hours 12 minutes 16 seconds