Introduction to Data Structures & Algorithms

This course is for all those people who want to learn data structure and Algorithm from absolute basic to Intermediate level. We don't expect you to have any prior knowledge on Data Structure or Algorithm, but a basic prior knowledge of any Programming Language(preferably C++) will be helpful.

Thanks for stopping by !

Reed courses certificate of completion

Digital certificate - Included

• Introduction 08:02

  • 1: Pilot Preview 01:33
  • 2: MinGW for gcc Compiler Preview 01:43
  • 3: Setting the path for gcc Compiler Preview 01:58
  • 4: Introduction Preview 02:48

• Time Complexity 13:12

  • 5: Master Method 07:31
  • 6: Recursion Tree Method 04:41
  • 7: Time Complexity 01:00

• Sorting Algorithms 2:15:22

  • 8: Bubble Sort 16:56
  • 9: Selection Sort 10:25
  • 10: Insertion Sort 09:35
  • 11: Merge Sort 14:33
  • 12: Quick Sort 22:13
  • 13: Heap Sort 10:30
  • 14: Counting Sort 12:22
  • 15: Radix Sort 14:58
  • 16: Bucket Sort 09:59
  • 17: Tree Sort 11:51
  • 18: Sorting Algorithms 02:00

• Divide & Conquer Algorithms 30:31

  • 19: Introduction 04:43
  • 20: Powering a Number 07:59
  • 21: Fibonacci Series 09:44
  • 22: Strassen's Algorithm for Matrix Multiplication 05:05
  • 23: Divide & Conquer 03:00

• Hashing 1:17:33

  • 24: Introduction 10:23
  • 25: Find all Triplets with 0 Sum 10:20
  • 26: Smallest element repeated 'k' times in an array 07:13
  • 27: Duplicate element within 'k' length 07:28
  • 28: Count Subarrays with equal number of 0's & 1's 10:22
  • 29: Minimum Deletions to make all the elements of an Array Same 07:08
  • 30: Group Words with same set of Characters 11:43
  • 31: Longest Subarray with sum divisible by 'k' 10:56
  • 32: Hashing 02:00

• Binary Search Tree 1:40:49

  • 33: Introduction 08:24
  • 34: Insertions in a Tree 14:23
  • 35: Deletions in a Tree 24:21
  • 36: Traversals Order in a Tree 11:30
  • 37: Rotations in a Tree 26:34
  • 38: Red Black Tree - Introduction 08:37
  • 39: Binary Search Tree 07:00

• Trie 1:58:20

  • 40: Introduction 06:10
  • 41: Insert & Search in a Trie 15:28
  • 42: Delete Operations in a Trie 10:57
  • 43: Sorting Array of Strings using Trie 12:39
  • 44: Auto Complete Feature using Trie 26:45
  • 45: How to Implement Reverse DNS LookUp Cache 25:16
  • 46: How to Implement Forward DNS LookUp Cache 20:05
  • 47: Trie 01:00

• Priority Queue 19:58

  • 48: Introduction to Priority Queue 04:18
  • 49: Priority Queue Implementation (Default) 07:46
  • 50: Min-Heap for Priority Queue Implementation 07:54

• Dynamic Programming 1:02:43

  • 51: Introduction 07:54
  • 52: Memoization 05:03
  • 53: Longest Common Subsequence 13:06
  • 54: 0-1 Knapsack Problem 10:03
  • 55: Fractional Knapsack 13:31
  • 56: Weighted Job Scheduling 10:06
  • 57: Dynamic Programming 03:00

• Graphs 3:34:06

  • 58: Introduction 07:36
  • 59: Graph Representation Methods, Adjacency Matrix 14:13
  • 60: Graph Representation Methods, Adjacency List 08:31
  • 61: Minimum Spanning Tree : Kruskal's Algorithm 24:01
  • 62: Minimum Spanning Tree: Prim's Algorithm 17:57
  • 63: Detect Cycle in a Directed Graph 16:46
  • 64: Detect Cycle in an Undirected Graph 15:37
  • 65: Topological Sorting 13:35
  • 66: Check whether the given Graph is Bipartite or not 10:48
  • 67: Breadth First Search(BFS) 12:08
  • 68: Depth First Search(DFS) 10:14
  • 69: Single Source Shortest Paths : Dijkstra's Algorithm 20:27
  • 70: Single Source Shortest Paths : Bellman Ford Algorithm 18:44
  • 71: All Source Shortest Paths : Floyd Warshall Algorithm 10:55
  • 72: Detecting Negative Cycle using Floyd Warshall 07:34
  • 73: Graphs 05:00

• Pattern Searching 1:10:48

  • 74: Naive Pattern Searching 07:47
  • 75: KMP Algorithm 13:14
  • 76: Rabin Karp Algorithm 13:32
  • 77: Finite Automata Algorithm 12:05
  • 78: Boyer Moore's Algorithm 10:09
  • 79: Z Algorithm 11:01
  • 80: Pattern Searching 03:00

• Geometric Algorithms 58:17

  • 81: Closest Pair of Paths 22:02
  • 82: How to check if Two Line Segments Intersect 13:17
  • 83: Convex Hull (Jarvis's Algorithms or Wrapping) 10:47
  • 84: How to check if Given FOUR Points form a Square 12:11

• Mathematical Algorithms 12:01

  • 85: Multiply TWO Numbers, without using Multiplication, Division or Bitwise Operator 03:10
  • 86: Babylonian Method of Square Root 03:23
  • 87: Sieve of Eratosthenes 05:28

• Bit Algorithms 24:35

  • 88: Karatsuba Algorithm for Bit Multiplication using Divide & Conquer 18:01
  • 89: Swap TWO Nibbles in a Byte 06:34

• Backtracking 1:09:01

  • 90: Knight's Tour Problem 17:23
  • 91: Rat in a Maze 13:30
  • 92: N-Queen Problem 13:06
  • 93: m Coloring Problem 12:19
  • 94: Generate n bit Gray Codes 06:25
  • 95: Print all Permutations of a Given String 04:18
  • 96: Backtracking 02:00

• BONUS 03:00

  • 97: Bonus Lecture: CHECK OUT 01:00
  • 98: Bonus Lecture: COMPETITIVE PROGRAMMING 02:00

This course is for all those people who want to learn data structure and Algorithm from absolute basic to Intermediate level. We don't expect you to have any prior knowledge on Data Structure or Algorithm, but a basic prior knowledge of any Programming Language(preferably C++) will be helpful.

Thanks for stopping by !

Engineering Students, Software working professionals who wants to learn Data Structure & Algorithm and get a job in top product based companies.

• Basic Programming Knowledge.
• Knowledge of any of the Programming Language(C/C++, Java, Python.)
• C++ Preferred for the Course

• You will learn about the whole world of Data Structures & Algorithms, about how the data can be stored & managed, with Least Time & Space Complexity.
• In-Depth knowledge of the working of Data Structures
• Exposure to C++14
• Efficient Working Mechanisms so as to be able to build a career as a Software Architect.

Currently there are no Q&As for this course. Be the first to ask a question.