The Last Algorithms Course You’ll Need

The Last Algorithms Course You’ll Need

English | MP4 | AVC 1920×1080 | AAC 48KHz 2ch | 60 Lessons (9h 21m) | 1.57 GB

The beginner friendly DSA course. This course will go through the common algorithms that you will encounter during your professional career. It will not just go over how to use them, but how they are implemented and their running times. You will leave this course with a better understanding of arrays, lists, trees, maps, and graphs, and their running times.

By participating along with us in the workshop, you’ll learn:

  • Learn about the fundamentals of algorithms and data structures.
  • Be able to use algorithms and data structures to have successful interviews
  • Practical understanding of Big O
Table of Contents

1 Introduction
2 Big O Time Complexity
3 Arrays Data Structure
4 Arrays Q&A
5 Linear Search & Kata Setup
6 Binary Search Algorithm
7 Pseudo Code Binary Search
8 Implementing Binary Search
9 Two Crystal Balls Problem
10 Implementing Two Crystal Balls
11 Bubble Sort
12 Implementing Bubble Sort
13 Linked List Data Structures
14 Linked List Complexity
15 Queue
16 Implementing a Queue
17 Queue Q&A
18 Stack
19 Implementing a Stack
20 Arrays vs Linked List
21 ArrayList
22 ArrayBuffer
23 Data Structures Q&A
24 Recursion
25 Path Finding: Base Case
26 Path Finding: Recursive Case
27 Recursion Q&A
28 QuickSort Algorithm
29 Implementing QuickSort
30 Linked List: prepend, insertAt, & append
31 Linked List: remove, get, & removeAt
32 Linked List Q&A
33 Debugging Linked List
34 Trees Overview
35 Tree Traversals
36 Implement Tree Traversal
37 Breadth-First Search
38 Implement Breadth-First Search
39 Search Practice
40 Implement Binary Tree Comparison
41 Depth-First: Find
42 Depth-First: Insert
43 Depth-First: Delete
44 Binary Search Tree Q&A
45 Implement Depth-First Search
46 Heap
47 Implementing Heap
48 Tries
49 Graphs Overview
50 Searching an Adjacency Matrix
51 Implementing BFS on Adjacency Matrix
52 Implement DFS on Adjacency List
53 Dijkstra’s Shortest Path
54 Implement Dijkstra’s Shortest Path
55 Dijkstra’s Shortest Path Run Time
56 Maps
57 LRU Cache
58 LRU Cache Setup
59 Implementing an LRU Cache
60 Wrapping Up

Homepage