knowledge = {
A : 알고 있으며 구현 가능한 알고리즘
B : 알고 있지만 구현 못하는 알고리즘
C : 잘 모르는 알고리즘
}
| category | name | knowledge |
|---|---|---|
| Implementation | for / while | A |
| Implementation | if / switch | A |
| Search | Brute Force | A |
| Search | Back Tracking | A |
| Search | Binary Search(이분 탐색) | A |
| Search | Ternary Search(삼분 탐색) | C |
| Search | Quick Search | C |
| Search | BFS | A |
| Search | DFS | A |
| Search | Parallel Binary Search | A |
| Graph | Djikstra | A |
| Graph | Floyd-Warshall | A |
| Graph | Bellman-Ford | B |
| Graph | Shortest Path Faster Algorithms | C |
| Graph | Minimum Spanning Tree | A |
| Graph | 위상정렬 | B |
| Graph | SCC(Kosaraju, Tarjan) | B |
| Graph | 2-SAT | B |
| Graph | Euler Path | B |
| Graph | Network flow | B |
| Graph | Bipartite Matching(이분 매칭) | B |
| Graph | Min Cut(최소 컷) | C |
| Graph | Minimum Vertex Cover | C |
| Graph | Maximum Isolate Set(최대독립집합) | C |
| Graph | Dinic | B |
| Graph | MCMF | C |
| Graph | Path Cover on DAG | C |
| Graph | Hopcroft-Karp | C |
| Graph | L-R Maxflow | C |
| Graph | Articulation Point(단절점) | C |
| Graph | Bridge(단절선) | C |
| Graph | Biconnected Componet(BCC) | C |
| Graph | Bridge Component | C |
| Graph | Hungarian Method | C |
| Graph | Hamiltonian Path | C |
| Graph | Dominator | C |
| Graph | LCA | C |
| Graph | 지름 / 반지름 / 이심율 | C |
| Tree | Heavy-Light Decomposition | C |
| Tree | Centroid Decomposition | C |
| Tree | Dominator Tree | C |
| Data Structure | Disjoint-Set | A |
| Data Structure | Set / Map | A |
| Data Structure | Segment Tree | B |
| Data Structure | SQRT decomposition | B |
| Data Structure | Fenwick Tree | B |
| Data Structure | 2D Fenwick Tree | C |
| Data Structure | Persistent Segment Tree | C |
| Data Structure | Lazy Propagation | A |
| Data Structure | Stack / Queue / Deque | A |
| Data Structure | Priority Queue | A |
| Data Structure | Merge Sort Tree | C |
| Data Structure | Mo's Algorithm | C |
| Data Structure | Splay Tree | C |
| Data Structure | Link-Cut Tree | C |
| Data Structure | Trie | B |
| Data Structure | Aho-Corasick | C |
| String | KMP | B |
| String | Hashing | B |
| String | Suffix Array | B |
| String | Suffix Automaton | C |
| String | Z-Algorithm | C |
| DP | Bitmask DP | B |
| DP | Tree DP | B |
| DP | Bitonic Tour | C |
| DP | Convex Hull Trick | C |
| DP | Knuth Optimization | C |
| DP | D&C Optimization | C |
| DP | Manacher Alogorithm | C |
| Math | 에라토스테네스의 체 | A |
| Math | 소인수 분해 | A |
| Math | 약수 고속검색 | A |
| Math | Fermat's Little Theorem | C |
| Math | Square and Multiply | A |
| Math | 확장 유클리드 알고리즘 | C |
| Math | 오일러 정리 | C |
| Math | 디오판토스 방정식 | C |
| Math | 중국인의 나머지 정리 | C |
| Math | 뤼카의 정리 | C |
| Math | 순열과 조합 | C |
| Math | 포함-배제 원리 | C |
| Math | 카라추바 알고리즘 | C |
| Math | FFT | C |
| Math | NTT | C |
| Math | 카탈랑 수 | C |
| Math | 뉴턴메소드 | C |
| Math | Matrix(행렬) | B |
| Geometric | 내적과 외적 | C |
| Geometric | CCW | A |
| Geometric | 선분 교차 | B |
| Geometric | Graham Scan | C |
| Geometric | Rotating Calipers | C |
| Geometric | Circle Intersection | C |
| Geometric | Inner Polygon | C |
| Geometric | Polygon Intersection | C |
| Geometric | Closest Point | C |
| ETC | Game Theorem | B |
| ETC | Grundy Number | B |
| ETC | Two Pointer / Sliding Window | A |
| ETC | DIvide & Conquer | B |
| ETC | Dynamic Connectivity | C |