Mastering Data Structures & Algorithms using C and C++

Arrays Basics

Practice : Arrays Basics

Structures

Practice : Structures

Pointers

Practice : Pointers

Reference in C++

Practice : Reference

Pointer to Structure

Practice : Pointer to Structure

Functions

Practice : Functions

Parameter Passing Methods

Practice : Parameter Passing Methods

Array as Parameter

Practice : Array as Parameter

Structure as Parameter

Practice : Structure as Parameter

Structures and Functions (Must Watch)

Converting a C program to a C++ class (Must Watch)

Practice : Monolithic Program

Practice : Modular Program

Practice : Structure and Functions

Practice : Object-Oriented Program

C++ Class and Constructor

Practice : C++ Class

Template classes

Practice : Template Class

Online C and C++ compiler

Setup CodeBlocks and Settings

Setup Dev-C++ and Settings

Debugging using Dev-C++

Debugging using CodeBlocks

Setup Visual Studio

Debugging using Visual Studio

Setup Xcode

Introduction

Stack vs Heap Memory

Stack vs Heap. Continued...

Physical vs Logical Data Structures

ADT

Time and Space Complexity

Time and Space Complexity from Code

How Recursion Works ( Tracing )

Generalising Recursion

How Recursion uses Stack

Recurrence Relation - Time Complexity of Recursion

Lets Code Recursion

Static and Global Variables in Recursion

Let's Code Static and Global in Recursion

Tail Recursion

Head Recursion

Tree Recursion

Let's Code Tree Recursion

Indirect Recursion

Let's Code Indirect Recursion

Nested Recursion

Let's Code Nested Recursion

Sum of Natural Number using Recursion

Let's Code Sum of N using Recursion

Factorial using Recursion

Let's Code Factorial using Recursion

Power using Recursion

Let's Code Power Recursion

Taylor Series using Recursion

Let's Code Taylor Series using Recursion

Taylor Series using Horner's Rule

Let's Code Taylor Series Horner's Rule - Recursion

Let's Code Taylor Series Iterative

Fibonacci Series using Recursion - Memoization

Let's Code Fibonacci

NCr using Recursion

Let's Code nCr using Recursion

Tower of Hanoi Problem

Let's Code Tower of Hanoi

Recursion

Quiz 1 Solutions

Introduction to Array

Declarations of Array

Demo - Array Declaration

Static vs Dynamic Arrays

Demo - Static vs Dynamic Array

How to Increase Array Size

Demo - Increasing Array Size

2D Arrays

Demo - 2D Array

Array Representation by Compiler

Row Major Formula for 2D Arrays

Column Major Formula for 2D Arrays

Formulas for nD Arrays

Formulas for 3D Arrays

Arrays Representation

Solutions for Quiz 2

Array ADT

Demo - Array ADT

Inserting in an Array

Let's Code Insert

Deleting from Array

Let's Code Delete

Linear Search

Improving Linear Search

Let's Code Linear Search

Binary Search

Binary Search Algorithm

Let's Code Binary Search

Analysis of Binary Search

Average Case Analysis of Binary Search

Get( ) Set( ) Avg( ) Max( ) functions on Array

Let's Code Get() Set() Max() on Array

Reverse and Shift an Array

Lest's Code Reversing an Array

Check if Array is Sorted

Let's Code to check if Array is Sorted

Merging Arrays

Let's Code to Merge Arrays

Set operations on Array - Union, Intersection and Difference

Let's Code Set operations on Array

Let's Code a Menu Driver program for Arrays

Let's convert C program for Array to C++

Let's Put all together in C++ program for Array

Student Challenge : Finding Single Missing Element in an Array

Student Challenge : Finding Multiple Missing Elements in an Array

Student Challenge : Finding Missing Element in an Array Method 2

Student Challenge Finding Duplicates in a Sorted Array

Student Challenge : Finding Duplicates in Sorted Array using Hashing

Student Challenge : Finding Duplicates in a Unsorted Array

Student Challenge : Finding a Pair of Elements with sum K

Student Challenge : Finding a Pair of Elements with sum K in Sorted Array

Student Challenge : Finding Max and Min in a single Scan

Array ADT

Solutions for Quiz 3

Introduction to Strings

Finding Length of a String

Changing Case of a String

Counting Words and Vowels in a String

Validating a String

Reversing a String

Comparing Strings and Checking Palindrome

Finding Duplicates in a String

Finding Duplicates in a String using Bitwise Operations

Checking if 2 Strings are Anagram (distinct letters)

Permutation of String

Section Introduction

Diagonal Matrix

Let's Code Diagonal Matrix

C++ class for Diagonal Matrix

Let's Code C++ class for Diagonal matrix

Lower Triangular Matrix Row-Major Mapping

Lower Triangular Matrix Column-Major Mapping

Let's Code Lower Triangular Matrix in C

Let's Code Lower Triangular Matrix in C++

Upper Triangular Matrix Row-Major Mapping

Upper Triangular Matrix Column-Major Mapping

Symmetric Matrix

Tri-Diagonal and Tri-Band Matrix

Toeplitz Matrix

Menu Driven Program for Matrices

Menu Driven Program for Matrices using Functions

How to Write C++ Classes for All Matrices

Matrices

Sparse Matrix Representation

Addition of Sparse Matrices

Array Representation of Sparse Matrix

Let's Code to Create Sparse Matrix

Program for Adding Sparse Matrix

Let's Code to Add Sparse Matrix

Let's Code Sparse Matrix using C++

Let's Code Sparse Matrix using C++ Continued.....

Polynomial Representation

Polynomial Evaluation

Polynomial Addition

Let's Code Polynomial

Why we need Dynamic Data Structure Linked List

About Linked List

More About Linked List

Display Linked List

Let's Code Display for Linked List

Recursive Display of Linked List

Let's Code Recursive Display for Linked List

Counting Nodes in a Linked List

Sum of All Elements in a Linked List

Let's Code Count and Sum

Maximum Element in a Linked List

Let's Code Max for Linked List

Searching in a Linked List

Improve Searching in Linked List

Let's Code Searching in Linked List

Inserting in a Linked List

Let's Code Insert for Linked List

Creating a Linked List using Insert

Creating a Linked List by Inserting at Last

Inserting in a Sorted Linked List

Let's Code Insert in Sorted Linked List

Deleting from Linked List

Let's Code Delete on Linked List

Check if a Linked List is Sorted

Let's Code to check if Linked List is Sorted

Remove Duplicates from Sorted Linked List

Let's Code to Remove Duplicates from Sorted Linked List

Reversing a Linked List

Reversing using Sliding Pointers

Recursive Reverse for Linked List

Let's Code Reversing a Linked List

Concatenating 2 Linked Lists

Merging 2 Linked Lists

Let's Code to Concatenate and Merge Linked Lists

Check for LOOP in Linked List

Let's Code to Check LOOP

Let's Code a C++ class for Linked List

Circular Linked List

Display Circular Linked List

Let’s Code Circular Linked List

Inserting in a Circular Linked List

Let's Code Insert for a Circular Linked List

Deleting From Circular Linked List

Let's Code Delete for Circular Linked List

Doubly Linked List

Let's Code Doubly Linked List

Insert in a Doubly Linked List

Let's Code Insert for Doubly Linked List

Deleting from Doubly Linked List

Let's Code Delete for Doubly Linked List

Reverse a Doubly Linked List

Let's Code Reverse for Doubly Linked List

Circular Doubly Linked List

Comparison of Linked List

Comparison of Array with Linked List

Student Challenge : Finding Middle Element of a Linked List.

Student Challenge : Finding Intersecting point of Two Linked List

Linked List

Student Challenge : Sparse Matrix using Linked List

Student Challenge: Polynomial Representation using Linked List

Let's Code Polynomial

Introduction to Stack

Stack using Array

Implementation os Stack using Array

Let's Code Stack using Array

Stack using Linked List

Stack Operations using Linked List

Let's Code Stack using Linked List

Let's Code C++ class for Stack using Linked List

Parenthesis Matching

Program for Parenthesis Matching

Let's Code Parenthesis Matching

More on Parenthesis Matching

Infix to Postfix Conversion

Associativity and Unary Operators

Infix to Postfix using Stack Method 1

Infix to Postfix using Stack Method 2

Program for Infix to Postfix Conversion

Let's Code Infix to Postfix Conversion

Student Challenge: Infix to Postfix with Associativity and Parenthesis

Evaluation of Postfix Expression

Program for Evaluation of Postfix

Let's Code Evaluation of Postfix

Stack

Queue ADT

Queue using Single Pointer

Queue using Two Pointers

Implementing Queue using Array

Let's Code Queue using Array

Let's Code Queue in C++

Drawback of Queue using Array

Circular Queue

Let's Code Circular Queue

Queue using Linked List

Let's Code Queue using Linked List

Double Ended Queue DEQUEUE

Priority Queues

Queue using 2 Stacks

Queue

Terminology

Number of Binary Trees using N Nodes

Height vs Nodes in Binary Tree

Internal Nodes vs External Nodes in Binary Tree

Strict Binary Tree

Height vs Node of Strict Binary Tree

Internal vs External Nodes of Strict Binary Trees

N-ary Trees

Analysis of n-Ary Trees

Representation of Binary Tree

Linked Representation of Binary Tree

Full vs Complete Binary Tree

Strict vs Complete Binary Tree

Binary Tree Traversals

Binary Tree Traversal Easy Method 1

Binary Tree Traversal Easy Method 2

Binary Tree Traversal Easy Method 3

Creating Binary Tree

Program to Create Binary Tree

Let's Code Creating Binary Tree

Let's Code Creating Binary Tree in C++

Preorder Tree Traversal

Inorder Tree Traversals Functions

Iterative Preorder

Iterative Inorder

Let's Code Iterative Traversals

Level Order Traversal

Let's Code Level Order Traversal

Can we Generate Tree from Traversals

Generating Tree from Traversals

Height and Count of Binary Tree

Let's Code Height and Count

Student Challenge : Count Leaf Nodes of a Binary Tree

Binary Trees

BST intro

Searching in a Binary Search Tree

Inserting in a Binary Search Tree

Recursive Insert in Binary Search Tree

Creating a Binary Search Tree

Let's code Binary Search Tree

Deleting from Binary Search Tree

Let's Code Recursive Insert and Delete on BST

Generating BST from Preorder

Program for Generating BST from Preorder

Drawbacks of Binary Search Tree

Binary Search Trees

Introduction to AVL Trees

Inserting in AVL with Rotations

General form of AVL Rotations

Let's Code LL Rotation on AVL

Let's Code LR Rotation on AVL

Generating AVL Tree

Deletion from AVL Tree with Rotations

Height Analysis of AVL Trees

2-3 Trees

2-3-4 Trees

Red-Black Trees Introduction

Red-Black Tree creation

Red-Black Trees vs 2-3-4 Trees

Creating Red-Black Tree similar to Creating 2-3-4 Tree

Red-Black Tree Deletion Cases

Red-Black Tree Deletion Examples

Red-Black Tree vs 2-3-4 Tree Deletion

Introduction to Heap

Inserting in a Heap

Program to Insert in a Heap

Creating a Heap

Deleting from Heap and Heap Sort

Let's Code Heap Sort

Heapify - Faster Method for creating Heap

Heap as Priority Queue

Criteria used for Analysing Sorts

Bubble Sort

Let's Code Bubble Sort

Insertion Sort

Insertion Sort Continued....

Program for Insertion Sort

Analysis of Insertion Sort

Let's Code Insertion Sort

Comparing Bubble and Insertion Sort

Selection Sort

Program for Selection Sort

Analysis of Selection Sort

Let's Code Selection Sort

Idea behind Quick Sort

Quick Sort

Analysis of Quick Sort

Analysis of Quick Sort Continued.....

Let's Code Quick Sort

Merging

Iterative Merge Sort

Let's Code Iterative Merge Sort

Recursive Merge Sort

Let's Code Recursive Merge Sort

Count Sort

Let's Code Count Sort

Bin / Bucket Sort

Radix Sort

Shell Sort

Let's Code Shell Sort

Introduction to Hashing

Chaining

Let's Code Chaining

Linear Probing

Let's Code Linear Probing

Quadratic Probing

Double Hashing

Hash Function Ideas

Hashing

Introduction to Graphs

Representation of Undirected Graph

Representation of Directed Graphs

Breadth First Search

Program for BFS

Depth First Search

Program for DFS

Let's Code BFS & DFS

Disjoint Subsets

Graphs

What are Recurrence Relations ?

Decreasing Function T(n)=T(n-1)+1

RR - T(n)=T(n-1)+n

RR - T(n)=2T(n-1)+1

Master Theorem for Decreasing Function

Dividing Function T(n)=T(n/2)+1

RR - T(n)=T(n/2)+n

RR - T(n)=2T(n/2)+1

RR - T(n)=2T(n/2)+n

RR - T(n)=2T(n/2)+n2

Master Theorem for Dividing Functions

Recurrence Relation for Root Functions

Master Theorem for Root Functions

Comparison of Functions

Why Asymptotic Notations?

Asymptotic Notations

Using Asymptotic Notations

Best and Worst Case Analysis

Algorithm Strategies

Divide and Conquer - Introduction

Binary Search using Divide and Conquer

Merge Sort Introduction

K-Way Merging

Iterative Merge Sort

Recursive Merge Sort

Strassen's Matrix Multiplication

What are Optimization Problems ?

Greedy Method - Introduction

Knapsack Problem - Fractional

Knapsack Algorithm

Minimum Cost Spanning Tree - Introduction

Kruskal's Method - MST

Kruskal's Algorithm

Prim's Method - MST

Prim's Algorithm

Dijkstra - Single Source Shortest Path

Dijkstra Algorithm

Optimal Merge Pattern

Dynamic Programming - Introduction

Recursion and Dynamic Programming

0/1 Knapsack Problem

0/1 Knapsack using Sets Method

0/1 Knapsack using Recursion

0/1 Knapsack using Memoization

0/1 Knapsack using Tabulation

Matrix Chain Multiplication - Introduction

Matrix Chain Multiplication using Recursion

Matrix Chain Multiplication using Memoization

Matrix Chain Multiplication using Tabulation

Longest Common Subsequence

LCS - Recursion

LCS - Memoization

LCS - Tabulation

Max Subarray Sum

Max Subarray Sum - Improvement

Max Subarray Sum using DP

Kadane's Max Subarray Sum

Max Subarray Sum using Divide and Conquer

Recursion - BruteForce - Backtracking - What is What

Backtracking - Introduction

N-Queens Problem - Introduction

N-Queens Problem - Solution

N-Queens Algorithm

Permutation Problem

Permutation Problem - Bounding Function

Rat in Maze Problem

Sudoku Solver

PDF for All Programs