algorithm
์ด 297๊ฐ์ ์ํค ยท 2 / 15 ํ์ด์ง ๐ก RSS ๐ธ๏ธ ๊ทธ๋ํ
- Hash Table: ํด์ ๊ธฐ๋ฐ ๋์ ๋๋ฆฌ#algorithm #data-structure #hash #map
- Huffman Coding: ์ต์ ์ ๋ ๋ถํธ#algorithm #foundation #greedy #compression #tree
- Implicit Treap: ๋ฐฐ์ด ์ธ๋ฑ์ค ๊ธฐ๋ฐ Treap#algorithm #data-structure #treap
- Inclusion and Exclusion: ํฌํจ๋ฐฐ์ ์๋ฆฌ#algorithm #math #combinatorics #mobius
- Johnson's Algorithm: sparse APSP#algorithm #graph #shortest-path #apsp
- Markov Chain: ์ํ ์ ์ด ํ๋ฅ#algorithm #foundation #probability #markov
- Matrix Exponentiation: ์ ํ ์ ํ์ fast#algorithm #dp #matrix #linear-recurrence
- Maximum Flow: Ford-Fulkerson, Edmonds-Karp, Dinic#algorithm #graph #network-flow #max-flow
- Median of Stream: ๋ ํ์ผ๋ก ์ค์๊ฐ ์ ์ง#algorithm #data-structure #heap #streaming
- Minimum Vertex Cover: ์ต์ ์ ์ ๋ฎ๊ฐ#algorithm #graph #cover #np-hard
- Nim Game: XOR ๊ท์น#algorithm #game #sprague-grundy
- Order Statistics Tree (OST): rank/select ์ง์ BST#algorithm #data-structure #tree #bst
- Pascal Triangle: ์ดํญ๊ณ์#algorithm #math #combinatorics
- Persistent Segment Tree (์์ ์ธ๊ทธ): ์์ ๋ณ ์ค๋ ์ท#algorithm #data-structure #segment-tree #persistent
- Priority Queue / Heap: ์ฐ์ ์์ ํ#algorithm #data-structure #heap #priority-queue
- RMQ (Range Minimum Query)#algorithm #data-structure #rmq
- Skip List: ํ๋ฅ ์ O(log N) ์ ๋ ฌ ๊ตฌ์กฐ#algorithm #data-structure #skip-list #probabilistic
- Spanning Tree, MST: ์ต์ ์ ์ฅ ํธ๋ฆฌ#algorithm #graph #mst #kruskal #prim
- Sprague-Grundy Theorem: ๊ฒ์ ์ด๋ก ํต์ผ#algorithm #game #grundy
- Subset Sum: ๋ถ๋ถ์งํฉ ํฉ#algorithm #math #combinatorics #dp