Algorithm-Collection

You can add following algorithms using any language to repo. please maintain the folder strcuture accordng to the following list structure.

Ex: If you adding the Hamilton Path algorithm using java, the folder structure would be,

   /BackTracking/HamiltonPath/

and the file name would be " HamiltonPath.java " or " HamiltonPath.txt "

List of Algorithms

• Breadth First Search ✔
• Binary Search Tree
• Backtracking
  • Hamilton Path
  • Knights Tour
  • NQueens
  • Rat In A Maze
  • Sudoku Algorithm
• Depth First Search ✔
• Bit Manipulation
  • Checking Power of 2
  • Nth Magic No
  • Set kth Bit
  • Sparse Number
  • Count Ones
  • Divide Integers
  • Even Odd
  • Print Subsets
  • Reverse Bits
  • Single Number
  • Swap Bits
• Data Structures
  • Disjoint Set
  • Doubly Linked List ✔
  • Fenwick Tree or Binary Indexed Tree ✔
  • LCA
  • Queue ✔
  • Queue From Stack ✔
  • Stack From Queue ✔
  • Red Black Tree
  • Singly Linked List ✔
  • Stack ✔
  • Segment Tree
  • Trie ✔
• Dynamic Programming
  • Coin Change ✔
  • Collect Maximum Points
  • Edit Distance ✔
  • Fibonacci Series ✔
  • Floyd Warshall Algorithm
  • Game Of Sum
  • Knapsack 0/1 ✔
  • Longest Palindrome Substring
  • Longest Common Increasing Subsequence
  • Longest Common Subsequence ✔
  • Longest Increasing Subsequence
  • Longest Repeated Subsequence
  • Matrix Chain Multiplication
  • Max Contiguous Subarray Sum ✔
  • Max Sum Increasing Subsequence
  • Minimum Path Sum
  • Number Of Islands
  • Print Neatly
  • Range Sum Querying ✔
  • Shortest Uncommon Subsequence
  • Subset Sum
• Graph Algorithms
  • Articulation Points
  • Bellman Ford SSSP ✔
  • Bridges
  • Centroid Decomposition
  • Detect Cycle
  • Dials Algorithm
  • Dijkstras SPT ✔
  • Euler Path
  • Floyd Warshall
  • Graph Coloring
  • Johnson's Algorithm
  • Kruskal MST
  • Prims MST
  • Sack
  • Targan SCC
  • Topological Sort ✔
• Greedy Algorithms
  • Activity Selection ✔
  • Containership
  • Equalizing Bit Strings
  • Gas Station
  • Greedy Graph Coloring
  • Huffman Coding
  • Knapsack
  • Kruskal's Minimum Spanning Tree
  • Maximum Increasing Subarray
  • Minimum Coins
  • Odd Sum Subsequence
• Hashing Algorithms
  • 2 Sum
  • 3 Sum
  • 4 Sum
• Mathematical Algorithms
  • 3 Sum square complexity ✔
  • Factors Of A Given Number ✔
  • Collatz Conjecture
  • Combinations ✔
  • Convuxhull
  • Euler's Totient Function
  • Prime Factorization ✔
  • Fast Exponentiation with Mod ✔
  • Floor Square Root ✔
  • Greatest Common Divisor ✔
  • Histogram Area
  • Last Digit Exp
  • Logarithm ✔
  • Lowest Common Multiple ✔
  • Matrix Power
  • Max Divisible Number
  • Max Sub Rectangle
  • Max Sub Square
  • Miller Rabin Primality Test
  • Modular Multiplication Inverse
  • Next Power of 2
  • Nth Root
  • Pascal Row
  • Power
  • Prime
  • Randomized Algorithms
  • Set
  • Sieve Of Eratosthenes
  • Square Root
  • Subset Sum
  • Sum Of Digits
  • Tower Of Hanoi
  • Truncated Square Root
• Network Flow
  • Dinic
  • Edmund Karp
  • Ford Fulkerson
  • Goldberg Tarjan
• Search Algorithms
  • Binary Search ✔
  • Fibonacci Search ✔
  • Hashing
  • Jump Search ✔
  • Linear Search ✔
  • Ternary Search ✔
• Sorting Algorithms
  • Bubble Sort
  • Counting Sort
  • Heap Sort
  • Index Sort
  • Insertion Sort
  • Merge Sort
  • Pancake Sorting
  • Quick Sort
  • Radix Sort
  • Selection Sort
  • Shell Sort
• String Algorithms
  • Anagram ✔
  • Balanced Parenthesis ✔
  • Hamming Distance
  • KMP
  • Palindrome ✔
  • String Automaton
  • String Matching
  • Substring
  • Top K Frequent Words
  • Top K Frequent Words In Java
  • Uncompressing Strings