Standard Template Library

• Vector
• String
• Pair
• Map
• Set
• Multiset
• Stack
• Queue
• Deque
• Priority Queue

Binary Search & Bisection

• Binary search
• Upper bound
• Lower bound
• Integer bisection
• Float bisection

Policy Based data structure

• Partial Sum
• Find By Order
• Order Of Key

Number Theroy

• Harmonic Series
• Sieve of Eratosthenes
• Prime factorization
• Modular arithmetic
• Number of divisor & Sum of divisors
• Euler Totient or Phi Function
• Upper bound of number of divisors
• Euler Phi Extension Theorem
• Euler Phi Divisor Sum Theorem
• Legendre's formula
• Factorization of factorial
• Extended Euclidean Algorithm
• Linear diophantine equation

Graph Theory

• Introduction to Graph
• Introduction to Tree
• Graph Representation in Adjacency Matrix
• Graph Representation in Adjacency List

Depth first search

• Minimum Spanning Tree
• All Pair Shortest Path Tree
• Detecting Cycle
• Path Finding
• Topological Sorting
• Bipartite Graph

Breath fast search

• Shortest Distance
• Flood Fill Algorithm
• Chess Knight Problem
• Snake and Ladder game
• Strongly Connected Graph
• Transitive Closure

Dynamic Programming

Introduction to Dynamic Programming

Fibonacchi Series

Recursive vs Tabulation

DP Solution Print

0-1 Knapsack Problem

Matrix Chain Multiplication

Coin Change

Travelling Sales Man

Dijkstra

• Statforward application
• Path printing
• Checking is an edge is in the shortest path
• Second shortest path

Floyd warshall

• Statforward application

Bit Mask Dp

• Statforward application
• Reducing state using number of bits in mask

Longest Common subsequence

• Statforward Application
• Solution printing
• Finding lexicographically smallest solutions

Longest increasing subsequence ( LIS )

• Stratforward dynamic programming application
• Solution printing
• Stratforward binary search application
• More practice problems on LIS using binary search