Algorithm | solved |
---|---|
Back Tracking | 13 |
Bellman Ford | 2 |
Binary Search | 10 |
Bruteforce | 8 |
Combinatorics | 2 |
Data Structure | 34 |
Dijkstra | 15 |
Union Find | 6 |
Divide and Conquer | 5 |
Dynamic Programming | 49 |
Fail | 1 |
Floyd Warshall | 5 |
Graph Traversal | 54 |
Greedy | 12 |
Implementation | 35 |
KMP | 5 |
LCA(Lowest Common Ancestor) | 13 |
Math | 12 |
MST(Minimum Spanning Tree) | 9 |
Prefix Sum | 9 |
Segment Tree | 62 |
Sorting | 1 |
String | 4 |
Topology Sort | 12 |
Tree | 6 |
Trie | 4 |
Two Pointer | 8 |
sum | 396 |
Level | solved |
---|---|
level1 | 5 |
level2 | 19 |
level3 | 22 |
level4 | 1 |
sum | 47 |
Algorithm | solved |
---|---|
array | 2 |
design | 2 |
segmenttree | 1 |
sum | 5 |
SubDomain | solved |
---|---|
introduction | 13 |
strings | 11 |
sum | 24 |
difficulty | solved |
---|---|
difficulty2 | 6 |
difficulty3 | 7 |
difficulty4 | 12 |
difficulty5 | 8 |
difficulty6 | 3 |
swtest | 4 |
sum | 40 |