Algorithms and Data Structures for Beginners

Algorithms and Data Structures for Beginners

English | MP4 | AVC 1920×1080 | AAC 44KHz 2ch | 35 Lessons (8h 22m) | 1.66 GB

Before we begin the course, let’s take a little look at what will be taught, who it’s for, and what you’ll need to be successful.

This course covers all the basic data structures and algorithms needed to be successful in technical interviews.

Who is this course for?

If you are a beginner, this course is for you. If you need to refresh your knowledge or are trying to make a career change, this course is also for you.

Course content

In technical interviews, you will have to write efficient algorithms, talk confidently about the design, analysis and trade-offs of a particular algorithm. The ability to succinctly accomplish these tasks in a timely manner and communicate your ideas consistently is what can make the difference in thousands of dollars in compensation.

Topics covered

  • Arrays
  • Linked lists
  • Recursion
  • Sorting
  • Binary search
  • Trees
  • Return
  • Heap/Priority Queue
  • Hashing
  • Graphs
  • Dynamic Programming
  • Bitwise operations
Table of Contents

1 Introduction

3 Static Arrays
4 Dynamic Arrays
5 Stacks

Linked List
6 Singly Linked Lists
7 Doubly Linked Lists
8 Queues

9 Factorial
10 Fibonacci Sequence

11 Insertion Sort
12 Merge Sort
13 Quick Sort
14 Bucket Sort

Binary Search
15 Search Array
16 Search Range

17 Binary Tree
18 Binary Search Tree
19 BST Insert and Remove
20 Depth-First Search
21 Breadth-First Search
22 BST Sets and Maps

23 Tree Maze

Heap & Priority Queue
24 Heap Properties
25 Push and Pop
26 Heapify

27 Hash Usage
28 Hash Implementation

29 Intro to Graphs
30 Matrix DFS
31 Matrix BFS
32 Adjacency List

Dynamic Programming
33 Dimension DP
34 Dimension DP

Bit Manipulation
35 Bit Operations