Backtracking

• Graph Coloring
• Knight Tour
• Minimax
• N Queens
• N Queens All Solution Optimised
• Nqueen Print All Solutions
• Rat Maze
• Sudoku Solve

Data Structures

• Avltree
• Binary Search Tree
• Binaryheap
• Circular Queue Using Linked List
• Cll
  • Cll
  • Cll
  • Main Cll
• Disjoint Set
• Doubly Linked List
• Linked List
• Linkedlist Implentation Usingarray
• List Array
• Morrisinorder
• Queue
• Queue Using Array
• Queue Using Array2
• Queue Using Linked List
• Queue Using Linkedlist
• Stack
• Stack Using Array
• Stack Using Linked List
• Test Queue
• Test Stack
• Test Stack Students
• Tree
• Trie Modern
• Trie Tree

Dynamic Programming

• 0 1 Knapsack
• Armstrong Number
• Bellman Ford
• Catalan Numbers
• Coin Change
• Cut Rod
• Edit Distance
• Egg Dropping Puzzle
• Fibonacci Bottom Up
• Fibonacci Top Down
• Floyd Warshall
• Kadane
• Longest Common String
• Longest Common Subsequence
• Longest Increasing Subsequence
• Longest Increasing Subsequence (Nlogn)
• Matrix Chain Multiplication
• Searching Of Element In Dynamic Array
• Tree Height

Geometry

• Line Segment Intersection

Graph

• Bfs
• Bridge Finding With Tarjan Algorithm
• Connected Components
• Connected Components With Dsu
• Cycle Check Directed Graph
• Dfs
• Dfs With Stack
• Dijkstra
• Kosaraju
• Kruskal
• Lca
• Max Flow With Ford Fulkerson And Edmond Karp Algo
• Prim
• Topological Sort
• Topological Sort By Kahns Algo

Greedy Algorithms

• Dijkstra
• Huffman
• Knapsack
• Kruskals Minimum Spanning Tree
• Prims Minimum Spanning Tree

Hashing

• Chaining
• Double Hash Hash Table
• Linear Probing Hash Table
• Quadratic Probing Hash Table

Machine Learning

• Adaline Learning
• Kohonen Som Topology
• Kohonen Som Trace

Math

• Binary Exponent
• Check Amicable Pair
• Check Prime
• Complex Numbers
• Double Factorial
• Eulers Totient Function
• Extended Euclid Algorithm
• Factorial
• Fast Power
• Fibonacci
• Fibonacci Fast
• Fibonacci Large
• Gcd Iterative Euclidean
• Gcd Of N Numbers
• Gcd Recursive Euclidean
• Large Factorial
• Large Number
• Least Common Multiple
• Miller Rabin
• Modular Inverse Fermat Little Theorem
• Number Of Positive Divisors
• Power For Huge Numbers
• Prime Factorization
• Prime Numbers
• Primes Up To Billion
• Realtime Stats
• Sieve Of Eratosthenes
• Sqrt Double
• String Fibonacci
• Sum Of Digits

Numerical Methods

• Bisection Method
• Brent Method Extrema
• Durand Kerner Roots
• False Position
• Gaussian Elimination
• Golden Search Extrema
• Lu Decompose
• Newton Raphson Method
• Ode Forward Euler
• Ode Midpoint Euler
• Ode Semi Implicit Euler
• Ordinary Least Squares Regressor
• Qr Decompose
• Qr Decomposition
• Qr Eigen Values
• Successive Approximation

Operations On Datastructures

• Array Left Rotation
• Array Right Rotation
• Circular Linked List
• Circular Queue Using Array
• Get Size Of Linked List
• Intersection Of 2 Arrays
• Reverse A Linked List Using Recusion
• Selectionsortlinkedlist
• Union Of 2 Arrays

Others

• Buzz Number
• Decimal To Binary
• Decimal To Hexadecimal
• Decimal To Roman Numeral
• Fast Interger Input
• Happy Number
• Matrix Exponentiation
• Palindrome Of Number
• Paranthesis Matching
• Pascal Triangle
• Primality Test
• Smallest Circle
• Sparse Matrix
• Spiral Print
• Stairs Pattern
• Tower Of Hanoi
• Vector Important Functions

Probability

• Addition Rule
• Bayes Theorem
• Binomial Dist
• Poisson Dist

Range Queries

• Fenwick Tree
• Mo
• Segtree

Search

• Binary Search
• Exponential Search
• Hash Search
• Interpolation Search
• Interpolation Search2
• Jump Search
• Linear Search
• Median Search
• Ternary Search
• Text Search

Sorting

• Bead Sort
• Bitonic Sort
• Bubble Sort
• Bucket Sort
• Cocktail Selection Sort
• Comb Sort
• Counting Sort
• Counting Sort String
• Heap Sort
• Insertion Sort
• Library Sort
• Merge Sort
• Non Recursive Merge Sort
• Numeric String Sort
• Odd Even Sort
• Quick Sort
• Radix Sort
• Selection Sort
• Shell Sort
• Shell Sort2
• Slow Sort
• Swap Sort
• Tim Sort

Strings

• Brute Force String Searching
• Knuth Morris Pratt
• Rabin Karp