Problems Base course RU

Solves

deduplication

Articles

PAR Algorithm Closest pair of points The two nearest of n points in n log n: a cut, a strip 2d wide and seven neighbours; with a grid, n on average. O(n log n) 2 problems

Problems

Tolstoy's anagrams

Often together

nearest neighbour 1 points 1 divide and conquer 1 geodata 1 randomized 1 hashing 1 classic 1 interviews 1