Teams Tracking - Competitive-Programming-UNSAAC/notebook GitHub Wiki
Teams Tracking
Este documento será para llevar un control del estudio y avance en los temas relacionados con la preparación para el ICPC. Este seguimiento nos permitirá organizar de manera más eficiente y cubrir todos los temas necesarios para el ICPC. Cada tema se clasificará en uno de los siguientes tres estados:
Data Structures
| Topic | Jhamsid | Justino | Piero |
|---|---|---|---|
| Basic Data Structures |  |
||
| Linked Lists | |
||
| Hashmaps, Hashtables | |
||
| Heap | |
||
| Tree | |
||
| Binary Tree | |
||
| Binary Search Tree | |
||
| AVL Tree | |
||
| Red-Black Tree | |
||
| Interval Tree | |
||
| K-Dimensional Tree | |
||
| Trie | |
||
| Segment Tree (Lazy Propagation) | |
||
| Persistent Segment Tree | |
||
| Fenwick Tree or Binary Indexed Tree(BIT) | |
||
| RMQ | |
||
| Sqrt Decomposition | |
||
| Union Find Disjoint Set | |
Searching & Sorting
| Topic | Jhamsid | Justino | Piero |
|---|---|---|---|
| Linear Search | |
||
| Binary Search | |
||
| Ternary Search | |
||
| Completed Search | |
||
| Merge Sort | |
||
| Quick Sort | |
||
| Counting Sort | |
Mathematics
| Topic | Jhamsid | Justino | Piero |
|---|---|---|---|
| Prime Numbers (Sieve of Eratosthenes) |  |
||
| GCD and LCM Euclid’s Algorithm | |
||
| Modular Exponentiation | |
||
| Matrix Exponentiation | |
||
| Long arithmetic (Multi, Add) | |
||
| Efficient Prime Factorization | |
||
| Fermat's Theorem | |
||
| Euler’s Totient Function | |
||
| Chinese Remainder Theorem | |
||
| Lucas Theorem | |
||
| Permutations & Combinations | |
||
| Probability | |
||
| Expected Value | |
||
| Bit Manipulation | |
||
| Pigeonhole Principle | |
||
| Xor Basis | |
Dynamic Programming
| Topic | Jhamsid | Justino | Piero |
|---|---|---|---|
| 0-1 Knapsack | |
|
|
| Subset Sum | |
|
|
| Longest Increasing Subsequence (with RMQ) | |
|
|
| Longest Common Subsequence | |
|
|
| Longest Path in a Directed Acyclic Graph (DAG) | |
|
|
| Matrix chain multiplication | |
|
|
| Coin Change | |
|
|
| Kadane | |
|
|
| Longest Palindromic Subsequence | |
|
|
| Rod Cutting | |
|
|
| Edit Distance | |
|
|
| Bitmask Dynamic Programming | |
|
|
| Digit Dynamic Programming | |
|
|
| Dynamic Programming on Trees | |
|
|
| Open Close Interval | |
|
|
| Slope trick | |
|
|
| SOS DP | |
|
|
Strings
| Topic | Jhamsid | Justino | Piero |
|---|---|---|---|
| Z algorithm | |
||
| Suffix Trees/Arrays | |
||
| Knuth-Morris-Pratt Algorithm (KMP) | |
||
| Rabin-Karp Algorithm | |
||
| Hash | |
||
| Aho Corasick Algorithm | |
||
| Finite Automata | |
Graph Theory
| Topic | Jhamsid | Justino | Piero |
|---|---|---|---|
| Depth First Search (DFS) | |
||
| Breadth First Search (BFS) | |
||
| Topological Sorting | |
||
| Dijkstra’s Shortest Path | |
||
| Minimum Spanning Tree | |
||
| Ford Bellman | |
||
| Floyd Warshall | |
||
| SCC | |
||
| Articulation Points |  |
||
| Bridges | |
||
| Union Find | |
||
| LCA (Lowest Common Ancestor) | |
||
| HLD (Heavy Light Decomposition) | |
||
| Graph Coloring | |
||
| Maximum Bipartite Matching | |
||
| Max Flow / Min Cut | |
Game Theory
| Topic | Jhamsid | Justino | Piero |
|---|---|---|---|
| Nim game | |
|
|
| Grundy numbers | |
|
|
| Sprague-Grundy theorem | |
Computational Geometry
| Topic | Jhamsid | Justino | Piero |
|---|---|---|---|
| Primitive Operations | |||
| Intuition | |||
| Polygon Inside, Outside | |||
| Implementing CCW | |||
| Immutable Point ADT | |||
| Convex Hull | |||
| Closest pair problem | |||
| Line intersection |
Others
| Topic | Jhamsid | Justino | Piero |
|---|---|---|---|
| Mo’s Algorithm | |||
| Graph Matching |