Concepts4

Problem Classification Patterns

Many competitive programming problems map to a small set of classic patterns; recognizing keywords and constraints lets you pick the right tool fast.

#problem classification#binary search on answer#two pointers+12

⚙️AlgorithmIntermediate

Bitset Optimization

Bitset optimization exploits word-level parallelism so one CPU instruction processes 64 bits at once on typical 64-bit machines.

#bitset#word-level parallelism#bitmask+12

⚙️AlgorithmIntermediate

Floyd-Warshall Algorithm

Floyd–Warshall computes the shortest distances between all pairs of vertices in O(n^3) time using dynamic programming.

#floyd-warshall#all pairs shortest path#apsp+12

⚙️AlgorithmAdvanced

Johnson's Algorithm

Johnson's Algorithm computes all-pairs shortest paths on sparse graphs by first removing negative edges via reweighting, then running Dijkstra from every vertex.

#johnson's algorithm#all pairs shortest paths#apsp+12