Algorithm_CheckList_43
 Share
The version of the browser you are using is no longer supported. Please upgrade to a supported browser.Dismiss

 
Comment only
 
 
ABCDEFGHIJKLMNOPQRSTUVWXYZ
1
Basics1. recursive functions
2
2. Int, long, float, double (memory size)
3
3. bit operations : &, |, ^, <<, >>, ~
4
4. big integers(>=10^19) +, -, * operations (without API like BigInteger)
5
Search & Sort5. depth-first & breadth-first search
6
6. time & space complexity
7
7. binary search
8
8. bubble sort
9
9. quick sort vs. merge sort (pros & cons)
10
10. counting sort & radix sort
11
11. largest rectangular in histogram in O(n)
12
Data Structure12. stack, queue, deque(double ended queue)
13
13. Vector(ArrayList) vs. List(LinkedList) (pros & cons)
14
14. Heap(Priority Queue) push(), pop()
15
15. DSU(Disjoint Set Union) & Union Find + path compression
16
16. Indexed Tree & Sparse Table + range sum / min / max
17
Probability17. permutations (multiset, circular, bracelet, complete)
18
18. combinations (with duplicated numbers, Binomial theorem, Pascal's triangle, Catalan numbers)
19
19. conditional probability (Bayesian)
20
20. Binomial Distribution, Gaussian Distribution
21
Discrete Math21. Euler’s Totient function using (not GCD but) sieve of Eratosthenes
22
22. Fermat's little theorem, modular multiplicative inverse
23
23. Extended Euclidean Algorithm
24
24. Chinese remainder theorem
25
25. calculate the number of cases, using Inclusion–exclusion principle
26
Graph26. Adjacency matrix vs. Adjacency list (pros & cons)
27
27. Dijkstra, Floyd-Warshall, Bellman-Ford algorithm
28
28. Prim's algorithm, Kruskal's algorithm to get MST(Minimum Spanning Tree)
29
29. DAG(Directed Acyclic Graph)
30
30. LCA(Lowest Common Ancestor) in Time O(log n)
31
31. Find Articulation Points & Bridges of bidirectional graph
32
32. Network Flow theory
33
String33. String match with KMP, Rabin-Karp fingerprinting, Suffix Array & LCP
34
34. String to Trie
35
35. Aho-Corasick algorithm
36
Geometry36. CCW(Counter ClockWise) function & vector outer product
37
37. shoelace formula (to calculate polygon area)
38
38. collision detection of two lines & point detection inside a polygon (using CCW function)
39
39. Convex hull using CCW function; Time O(n log n)
40
40. Plane Sweeping (Overlapping rectangles)
41
Dynamic Prgramming
41. Top-down, Bottom-up, Recursive (Pros & Cons)
42
42. Base cases, Value function, Memoization
43
43. well-known problems (Knapsack, LIS, Bit Mask DP)
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
Loading...
 
 
 
Sheet1
 
 
Main menu