Method
greedy
Articles
SRT
Technique
Binary search on the answer
If checking an answer is easier than finding it, and the check is monotone, search for the answer by halving.
O(log D · cost of a check)
2 problems
GRA
Algorithm
Dijkstra's algorithm
Shortest paths from one vertex in a weighted graph without negative edges.
O((V + E) log V)
3 problems
ML
Algorithm
Decision tree
Answers with a chain of questions “feature ≤ threshold?”; each question is chosen so that uncertainty falls the most.
O(h · F · n log n) to build; O(h) to answer
2 problems
Problems
Often together
classic 3 interviews 3 binary search 1 searching 1 optimization 1 contests 1 shortest path 1 heap 1 weighted graph 1 graph 1 maps and navigation 1 networks 1