CursosPago

Algorithms and Data Structures for Beginners

08:22:04 Inglés Premium 31/01/2024 35 videos

Descripción del curso

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.

Curriculum

Section 1: Module 1

  • 02 - 0. Introduction 00:50
  • 03 - 1. RAM 05:51
  • 04 - 2. Static Arrays 14:36
  • 05 - 3. Dynamic Arrays 16:26
  • 06 - 4. Stacks 04:27
  • 07 - 5. Singly Linked Lists 11:50
  • 08 - 6. Doubly Linked Lists 09:31
  • 09 - 7. Queues 03:33
  • 10 - 8. Factorial 11:08
  • 11 - 9. Fibonacci Sequence 12:27
  • 12 - 10. Insertion Sort 19:27
  • 13 - 11. Merge Sort 21:49
  • 14 - 12. Quick Sort 16:44
  • 15 - 13. Bucket Sort 13:35
  • 16 - 14. Search Array 15:32
  • 17 - 15. Search Range 07:34
  • 18 - 16. Binary Tree 11:12
  • 19 - 17. Binary Search Tree 14:35
  • 20 - 18. BST Insert and Remove 21:38
  • 21 - 19. Depth-First Search 15:28
  • 22 - 20. Breadth-First Search 11:24
  • 23 - 21. BST Sets and Maps 05:50
  • 24 - 22. Tree Maze 13:59
  • 25 - 23. Heap Properties 14:07
  • 26 - 24. Push and Pop 17:44
  • 27 - 25. Heapify 14:35
  • 28 - 26. Hash Usage 10:01
  • 29 - 27. Hash Implementation 28:52
  • 30 - 28. Intro to Graphs 22:03
  • 31 - 29. Matrix DFS 21:53
  • 32 - 30. Matrix BFS 13:44
  • 33 - 31. Adjacency List 19:44
  • 34 - 32. 1-Dimension DP 20:02
  • 35 - 33. 2-Dimension DP 22:30
  • 36 - 34. Bit Operations 17:23

About the Instructor

Instructor

neetcode.io

Course

$0.00

$8.00
Que esta incluido?
  • Streaming Multiplataforma
  • Acceso de por vida
  • Soporte al cliente
  • Actualizaciones gratuitas