Please enable JavaScript.
Coggle requires JavaScript to display documents.
Competitive Programming - Coggle Diagram
Competitive Programming
Bitwise Operators
XOR ^ :check:
Left Shift << :check:
Right Shift >> :check:
OR | :check:
AND & :check:
NOT :check:
Graphs
Shorted Path
BFS :<3:
Dijikstra :warning:
Bellman Ford :question:
Floyd :<3:
Traversal
BFS :<3:
DFS :<3:
Types
Directed :star:
Non-directed :smiley:
Cyclic :fire:
Acyclic :smiley:
Bipatride :question:
Lowest Common Ancestor :question:
Binary Indexed Tree :pencil2:
Topological Sort :question:
:
Queries
Prefix Sum :<3:
Fenwick Tree :star:
Segment Tree
:star:
Difference Array :check:
Dynamic Programming
Knapsack : :pencil2:
Bitset DP :question:
Recursion + Memoization :<3:
Binary Search
Number Theory
gcd&lcm :smiley:
Prime Numbers :smiley:
Factorization :smiley:
Game Theory
Geometry
Polygon Area : :check:
Convex Hull
:!?:
Modulo
Combinatorics
Binomial theorem
:check:
