1 |
2/8 |
|
|
|
|
2 |
2/8 |
|
|
|
|
3 |
2/8 |
|
|
|
|
4 |
2/8 |
|
|
Alternating Permutations |
Daniel Du |
5 |
2/10 |
Parsing context-free grammar |
Paul Cernek |
DP optimization: divide and conquer. |
Andrew Kim |
6 |
2/10 |
Tarjan’s bridge and articulation point detection |
Edward Choi |
Graph coloring |
Harlin Brandvold |
7 |
2/10 |
Hashing and the Rabin-Karp algorithm |
Derek Zhang |
Fast Fourier Transform |
David Zheng |
8 |
2/10 |
Reversing subarray quickly |
Alfred Xing |
Burrows-Wheeler Transform |
Coulter Beeson |
9 |
2/15 |
Disjoint set data structure |
Leo Cho |
Euler Tour - Heirholzer's algorithm |
Jack Mandeville |
10 |
2/15 |
Fuzzy string matching |
Michael Wagler |
Persistent tree |
Rohin Patel |
11 |
2/15 |
Heavy-Light Edges |
Alex Gonzalez |
Generalized Gambler's Ruin |
Bob Yang |
12 |
2/15 |
Boyer-Moore string matching |
Jack Li |
2-SAT |
Cathy Leung |
13 |
2/17 |
Longest common substring of n strings |
Vastaav Anand |
Strongly connected components |
Joseph Hsu |
14 |
2/17 |
Johnson’s algorithm |
Kanghee Park |
DP optimization: convex hull |
Joey Lee |
15 |
2/17 |
Suurballe’s algorithm |
Eugene Xie |
k-th shortest path |
Peter Siemens |
16 |
2/17 |
Link-cut tree. |
Radu Nesiu |
Find edges part of all MSTs |
David Chong |