Data Structure & Algorithms Complete Course in Java

Course Curriculum

Chapter 1: Array problems solving techniques with examples

Lecture 1: Time Complexity and Space Complexity Introduction

Lecture 2: Design a data Structure which support Insert delete, Random in O(1) time

Lecture 3: Segregation logic to Sort an array of 0's, 1's and 2's

Lecture 4: Merge Sort Introduction

Lecture 5: Merge Sort Code Implementation

Lecture 6: Linear time approach to solve jump game problem

Lecture 7: Digit rearrangement method to find next greater number with same set of digits

Lecture 8: Greedy Techniques to find minimum number of platforms

Lecture 9: Print matrix in spiral order without any extra space

Lecture 10: Count frequencies of array elements in O(n) time complexity

Lecture 11: Linear time approach to solve Stock Buy Sell Problem

Lecture 12: In-place matrix rotation by 90 degree problem

Lecture 13: Array puzzle of solving celebrity problem

Lecture 14: Next Permutation Problem

Lecture 15: QuickSelect Algorithm to find the Kth smallest Element in array – 1

Lecture 16: QuickSelect Algorithm to find the Kth smallest Element in array – 2

Lecture 17: Binary search method to find square root of an element

Lecture 18: Rain Trapping Problem

Lecture 19: Merge sort method to Count inversion in an array

Lecture 20: Binary search method to find Median of two sorted Array

Lecture 21: Smallest window in a string containing all characters of another string – 1

Lecture 22: Smallest window in a string containing all characters of another string – 2

Chapter 2: Linked List problem

Lecture 1: Linked List Creation Introduction

Lecture 2: Single Linked List (Insertion, Search)

Lecture 3: Double Linked List (Insertion, Search)

Lecture 4: Flattering of LinkedList

Lecture 5: Merge two Sorted Linked List

Lecture 6: Sort Linked List using Merge Sort

Lecture 7: Clone a Linked List

Lecture 8: Reverse K Linked List

Chapter 3: Stack/Queue Problems

Lecture 1: Stack Operation Implementation

Lecture 2: Queue Operation Implementation

Lecture 3: Circular Queue Implementation

Lecture 4: Histogram Problem

Lecture 5: Stack that Supports getMin() in O(1)

Lecture 6: Find Maximum size rectangle in Binary Sub-matrix

Lecture 7: Sliding Window Problem using deque Data Structure

Chapter 4: Binary Tree Problems

Lecture 1: Binary Search Algorithm Introduction

Lecture 2: Connect Nodes at Same level in a Binary Tree

Lecture 3: Convert a Binary Tree to Doubly Linked List

Lecture 4: Print nodes at k distance from root

Lecture 5: Print all Nodes at Distance k from a given Node

Lecture 6: Boundary Traversal of Binary Tree

Lecture 7: Bottom View of Binary Tree

Lecture 8: Construct Tree from PostOrder

Lecture 9: Diameter of Binary tree

Lecture 10: Left View of Binary Tree

Lecture 11: Reverse level order Traversal of Binary Tree

Lecture 12: Vertical sum of Binary Tree

Lecture 13: Spiral Order of Binary Tree

Lecture 14: Serialize and Deserialize a Binary Tree

Lecture 15: Check if two N-ary trees are Mirror image or not

Lecture 16: Maximum Path Sum in a Binary Tree

Chapter 5: Hashing/Heap Sort

Lecture 1: Heapify operation implementation

Lecture 2: Min/Max Heap Implementation

Lecture 3: Group Anagrams Together

Lecture 4: Find first non-repeating character from a stream of characters

Lecture 5: Design and implement LRU

Lecture 6: Four Sum Problem

Lecture 7: Convert Number to Words Problems

Lecture 8: Median of running data streams problem

Lecture 9: Merge k Sorted arrays

Chapter 6: Graph Algorithms & Application

Lecture 1: Depth-first search method to find cycle in a graph

Lecture 2: Topological sorting concepts and implementation

Lecture 3: Find Number of IsLand in matrix

Lecture 4: Dijkstra Algorithm explanation with example

Lecture 5: Topological Algorithm to solve alien dictionary problem

Lecture 6: Breadth first search algorithm to solve Rotten Orange Problem

Lecture 7: Trie data structure approach to solve word boggle Problem

Lecture 8: Breadth first search algorithm to solve snake ladder problem

Lecture 9: Understanding Queue based approach to Jumping Number problem

Lecture 10: Trie data Structure implementation

Lecture 11: Type head suggestion problem

Chapter 7: Backtracking Algorithm Explanation with Examples

Lecture 1: N Queen Problem

Lecture 2: Sudoku Solving Problem – 1

Lecture 3: Sudoku solving Problem – 2

Lecture 4: Print all Permutations of a given String

Lecture 5: Rat Maze Problem

Lecture 6: Knight Walk Problem

Lecture 7: Implement pow(x, n)

Chapter 8: Dynamic Programming tips and tricks with examples

Lecture 1: How to Solve DP problems

Lecture 2: Longest Common Subsequences

Lecture 3: Edit Distance Problem

Lecture 4: Coin Change Problem

Lecture 5: Longest Palindrome Subsequences

Lecture 6: Word Break Problem

Lecture 7: Egg Dropping Problem

Lecture 8: KnapSack Problems

Lecture 9: Keystroke Problem

Lecture 10: String interleave Problem

Lecture 11: Partition Problem

Lecture 12: Wild Card Problem