CodeRed

Competetive Programming Algorithms & Data Structures

1 - Sorting & Searching

• Searching
  • Binary Search
  • BinarySearchClass
  • Ternary Search
• Sorting
  • Counting Sort
  • Merge Sort
  • Quick Sort

2 - Number Theory

• Divisors
  • Divisors
  • Number Of Divisors - CBRT
  • Number Of Divisors - SIEVE
  • Number Of Divisors - SQRT
  • Sum of Divisors
• Euler Totient - PHI
  • Euler Phi - SIEVE
  • Euler Phi - Single
  • Euler Phi - Using Prime
• Factorization
  • Factorize - Pollard Rho
  • Factorize - Single
  • Factorize - Using Primes
  • Factorize - Using Smallest Prime
• Linear Diophantine Equation
  • Find Any Solution
  • Number Of Solution In Interval
  • README
• Miscellaneous
  • Chinese Reminder Theorem
  • Goldbachs Conjecture
  • Mobious Function
  • Trailling Zeros
• Numbers
  • Catalan Number
  • Stirling Numbers Second Kind
  • Super Catalan Number
• Prime Test
  • Miller Rabin
  • Segment Sieve
  • Sieve
  • Single - SQRT
• Binomial Coefficient - NCR
• Chinese Reminder Theorem - CRT
• Combinatorics Basics
• Extended GCD - EGCD
• Factorials
• GCD & LCM
• Inverse
• Lucas Theorem
• Moduler Exponential - BigMod
• Moduler Multiplication
• Moduler Power & Multiply

3 - Data Structures

• Binary Indexed Tree - BIT
  • Bit 2D
  • Bit 3D
  • Bit Range Query Point Update
  • Bit Range Query Range Update
• MOS Algorithm
  • MOS - Tree
  • MOS - UPDATE
  • MOS
• Segment Tree - ST
  • Segment Tree - Lazy Propagation
  • Segment Tree - Persistent
  • Segment Tree
• Sparse Table
  • Sparse Table 2D
  • Sparse Table
• - Problems
• Policy Base Data Structure - PBDS
• Square Root Decomposition - SQRT
• Union Find Disjoint Sets - UFDS

4 - Graph

• Lowest Common Ancestor
  • Lowest Common Ancestor for Range Query
  • Lowest Common Ancestor with Binary Lifting - LCA
• Basics
  • BFS - Grid
  • BFS
  • Bipartite Graph
  • Connected Component
  • DFS
  • Flood Fill
• Cycle
  • Directed
  • Simple Directed
  • Undirected
• Heavy Light Decomposition
  • Heavy Light Decomposition - Anudeep
  • Heavy Light Decomposition - Lazy
  • Heavy Light Decomposition
• Max Flow
  • Dinic
  • Dinic2
• Maximum Matching
  • Faster Kuhn
  • Kuhn
• Minimum Spanning Tree
  • Minimum Spanning Tree - Kruskal
  • Minimum Spanning Tree - Prim
• Topological Sort
  • Topological Sort - Cp Algo
  • Topological Sort - Using In Degree
• 2sat
• Articulation Bridge - online
• Articulation Points & Bridges
• Bellman Ford
• Centroid of a Tree
• Dijkstra
• Floyd Warshall
• Shortest Path Faster Algorithm - SPFA
• Strongly Connected Component - SCC

5 - String

• Minimum String Rotation
  • Booth Algorithm
  • Greedy
• Palindrom
  • Manachers Algorithm
  • Palindromic Tree
  • PT - All Unique Palindrom
• String Hashing
  • Problems
    • Longest Common Substring
  • Ashik Vai Class
  • String Hashing - Ashik Vai
  • String Hashing - Class
  • String Hashing - Comparato
• String Matching
  • Aho Corasick
  • Knuth-Morris-Pratt - KMP
  • Z Algorithm
• Suffix Array
  • Problems
    • Kth Substring
    • Longest Common Substring - Multiple String
    • Longest Common Substring
  • Counting Sort
  • Smallest Cyclic Shift - Complex
  • Smallest Cyclic Shift - Simple
• Suffix Automata
  • Problems
    • Build Suffix Array
    • Distinct Number of Substring - Expanding
    • Distinct Number of Substring
    • First Postion of a string
    • Frequency of a string
    • Kth Substring
    • Longest Common Substring
    • Minimum Cyclic Shift
    • Total Lenght of Distinct Number of Substring
  • Suffix Automata - Class
  • Suffix Automata
• Trie
  • Dynamic
  • Multiple Trie(static)
  • Static

6 - Dynamic Programming

• AtCoder - Educational DP Contest
  • A - Frog 1
  • B - Frog 2
  • C - Vacation
  • D - Knapsack 1
  • E - Knapsack 2
  • F - LCS
  • G - Longest Path
  • H - Grid 1
  • I - Coins
  • J - Sushi
  • K - Stones
  • L - Deque
  • M - Candies
  • N - Slimes
  • O - Matching
  • P - Independent Set
  • Q - Flowers
  • R - Walk
  • S - Digit Sum
  • T - Permutation
  • U - Grouping
  • V - Subtree
  • X - Tower
• CSES - Dynamic Programming
  • Array Description
  • Book Shop
  • Coin Combinations I
  • Coin Combinations II
  • Counting Numbers
  • Counting Tilings
  • Counting Towers
  • Dice Combinations
  • Edit Distance
  • Elevator Rides
  • Grid Paths
  • Increasing Subsequence
  • Minimizing Coins
  • Money Sums
  • Projects
  • Rectangle Cutting
  • Removal Game
  • Removing Digits
  • Two Sets II
• Digit Dp
• Edit Distance
• Egg Droping Puzzle
• Knapsack
• Largest Independent Set
• Longest Biotonic Subsequence
• Longest Common Subsequence
• Longest Increasing Subsequence
• Longest Palindromic Subsequence
• Matrix Chain Multiplication
• Maximum Product Increasing Subsequence
• Maximum Sum Increasing Subsequence
• Subset Sum
• Total Palindromic Subsequence Count
• Travel Salesman Problem - TSP

7 - Miscellaneous

• Big-Int
  • BigInt
  • BigInt2
• Matrix Exponential
  • Matrix Exponential - Fast
  • Matrix Exponential
• Minimum Eculidean Distance
  • Minimum Euclidean Distance - Merge Sort
  • Minimum_Euclidean_Distance - Greedy
• Bits
• Cycle Finding
• Double Comparasion
• Get-Cmp
• Josephus
• Largest Histogram Area
• Maximum Subarray - Kadane's Algorithm
• Meet In The Middle
• Mod-Int
• Mod-Pair
• Namespace - PAIRS
• Small to Large Technique

8 - Reader _ Debug _ Precode

• dbg
• Fast Read Write
• Template - Contest
• Template - Simple

9 - Geometry

• ConvexHull