Introduction to Algorithms

Collision avoidance using linear probing

Implement hash table with linear probing - Insert

Implement hash table with linear probing - Delete

Implement hash table with linear probing - Search

Open Hashing or Separate Chaining

Introduction to selection sort

Selection sort

Selection sort time and space complexity

Introduction to bubble sort

How to write the algorithms

Bubble sort

Bubble sort time and space complexity

Introduction to insertion sort

Insertion sort

Insertion sort time and space complexity

Introduction to Binary Heap

Heapify

Quick Sort Introduction

Implementation of Partion function - Quick Sort

Merge Sort I

How to analyse the algorithms

Merge Sort II

Heap Sort

Introduction to Divide and Conquer Strategy

Binary Search using Divide and Conquer Strategy

What is an optimization problem How to solve it

Introduction to Dynamic Programming

Memoization Avoid Recomputation Issue in Top-Down Approach

Implementation of Nth Fibonacci Bottom-Up approach

Implementation of Nth Fibonacci To-Down Approach with Memoization

Introduction to Greedy Algorithms

Time and Space Complexity Analysis - Part 1

Minimum Coin Exchange Problem

Greedy can be Wrong Yes!

Implementation of Minimum Coin Exchange Problem

Breadth First Search(BFS)

Depth First Search (DFS)

Time and Space Complexity Analysis - Part 2

Why analysing time complexity is important

Binary Search - Implementation, Time & Space complexity

Linear Search - Implementation, Time & Space complexity

Introduction to hashing and collision