Competitive-Programming-all-of-algorithm

This repositories will work all of algorithm code for competitive programming .

Standard Template Library (STL)

• Vector
• String
• Pair
• Map
• Set
• MultiSet
• Stack
• Queue
• Dequeue
• Priority Queue

Data Structure

• ADT
• Stack
• Queue
• Linked List
• Tree
• Binary Search Tree(BST)
• Generic Tree
• Matrices
• DisJoint Set Union

Bit manipulation

• And OR XOR Operation
• Even And Odd
• popCount builtinFunction
• Left Shift & Right Shift
• Check Ith Bit
• Clear Ith Bit
• setBit
• UpdateIthBit
• Clear Last Digit
• Clear Bits of Range
• Replace Bits
• Power of Two
• CountOf Bit
• Convert Decimal to Binary
• Array Unique Number
• Subset
• Array Unique Number another way

Number Theory

• simple Divisor
• optimize Divisor
• simple prime
• sieve of eratosthenes
• optimize sieve of eratosthenes
• GCD & LCM
• prime factorization
• Nod
• Modular Arithmetic Sum
• Big Addition
• Big Factorial

Recursion

• Factorial
• Fibonacci
• Power
• Number of Digit
• Sum of Digit
• Count of Zero
• Array is Sorted
• Sum of array
• array element present
• First Index Array
• Array last index
• Array all position print element
• Check palindrome
• Reverse Print
• Replace char
• Remove Character
• Print SubString
• Convert String to Int
• String Permutation
• Tower Of Hanoi

Searching Technic

• Binary search (lower bound,upper bound)
• Linear Search

Sorting Algorithm

• Selection sort
• Bubble Sort
• Inbuilt Sort
• Merge Sort
• Quick Sort
• Insertion Sort
• Counting Sort
• Inversion Count

Graph Theory

• Adjacency Matrix
• Weighted Graph
• Breadth First Search(BFS) & different way implementation
• Depth First Search(DFS) & different way implementation
• DisConnected Graph using BFS
• DisConnected Graph using DFS
• Find No Connected using DFS
• Lowest Common Ancestor using TwoPointer
• Topological Sort & different way implementation
• Dijkstra Algorithm
• FloydWarshall algorithm
• Bellmanford algorithm
• prims

Dynamic programming

• Fibonacci
• Fibonacci bottom up
• Fibonacci to down
• N-K Ladders
• Minimum jumps
• Longest Increasing subsequence
• Longest common subsequence
• Knapsack
• Coin Change

Linear Recurrences & Matrix Exponentiation

• Binary Exponentiation Power
• Modular Exponentiation
• Fast Multiplication

Backtracking

• Permutation
• Maximum Bitwise or set
• SubSet
• Brackets
• N-Queen

Segment Tree

• Segment Tree Building
• Segment Tree Query
• Segment Tree Maximum Minimum Query
• Update Operation
• Lazy propagation
• FenWick Tree

Sqrt DeComposition

• Sqrt DeComposition
• DeQuery