SUMMARY.md

Algorithm

• Array
  • At Most To Equal
  • Count Inversions In An Array
  • Interleaving Placement
  • Kadane
  • Left To Right State Transition
  • Permutation
  • Quick Select
  • Sliding Window
  • Two Pointers
• Binary Tree
  • Avl Tree
  • Binary Search Tree
  • Serialization And Deserialization
  • Traversal
• Company
  • Facebook
• Cpp
  • Array
  • Memset 3 F
  • Overflow
• Data Structure
  • Binary Indexed Tree
  • Segment Tree And Binary Index Tree
  • Segment Tree
  • Stack
  • Trie
  • Union Find
• Dynamic Programming
  • Knapsack
    • 0 1 Knapsack
    • Bounded Knapsack
    • Unbounded Knapsack
  • Bitmask Dp
  • Dp On Subsets
  • Dp On Tree
  • Dp With Sorting
  • Selective State Dp
  • Travelling Salesperson
• Graph
  • Minimum Spanning Tree
    • Kruskal
    • Prim
  • Shortest Path
    • Bellman Ford
    • Dijkstra
    • Floyd Warshall
    • Johnson
    • Shortest Path Faster Algorithm
  • Bi Directional Breadth First Search
  • Bipartite
  • Breadth First Search
  • Component Coloring
  • Component Count
  • Depth First Search
  • Eulerian Path
  • Maximum Bipartite Matching
  • Tarjan
  • Topological Sort
  • Tree Diameter
  • Tree Ring Order Traversal
• Greedy
  • Greedy Scheduling
  • Regret Greedy
• Math
  • Catalan Number
  • Combinatorics
  • Factorial
  • Factorization
  • Fast Pow
  • Gcd
  • Geometry
  • Get Digits
  • Lcm
  • Median Minimizes Sum Of Absolute Deviations
  • Mode
  • Modular Multiplicative Inverse
  • Palindrome
  • Prime Number
  • Round Up
  • Sieve Of Eratosthenes
  • Stars And Bars
  • Sum Of Sequence
• Miscellaneous
  • Bin Packing
  • Floyds Tortoise And Hare
  • Hungarian
  • Palindrome
• Sort
  • Bubble Sort
  • Cycle Sort
  • Heap Sort
  • Merge Sort
  • Quick Sort
  • Sorting
• Stl
  • Cpp Stl
  • Istringstream
  • Lower Bound Upper Bound
  • Priority Queue
• String
  • Kmp
  • Manacher
  • Rabin Karp
  • String Processing
  • Z

• Backtracking
• Binary Answer
• Binary Lifting
• Binary Search
• Bit Manipulation
• Date
• Difference Array
• Discretization
• Divide And Conquer
• Gray Code
• Great Problems For Practice
• Interval Scheduling Maximization
• Io Optimization
• K Subset Partitioning
• Line Sweep
• Longest Common Subsequence
• Longest Increasing Subsequence
• Meet In The Middle
• Minmax
• Mono Deque
• Monotonic Stack
• Offline Query
• P And Np
• Prefix State Map
• Prefix Sum
• Random
• Reservoir Sampling
• Reverse Polish Notation
• Sqrt Decomposition