Common Prefixes and Suffixes Flipbooks *Newly Updated* flipbook for 5 common prefixes and 5 common suffixes: bi-, tri-, co-, de-, en-, -able, -ible, -ish, -ance, -ence. Can be used as flipbook or within an interactive notebook. If you want specific algorithms, my top 10 would be: * Dijkstra's - depending on the type of contest, you might see basic pathfinding problems, or you might see problems with non-obvious reductions to pathfinding problems. Another aspect is longest prefix match. Every BGP router sends the packets to the router/interface that matches the longest prefix. Assuming that there are two choices 61.4/16 and 61.4.2/24 for a packet bound to 61.4.2.1, the latter router is preferred since the route is more specific. This is common sense. Nothing fancy. 1D Divide & Conquer p1 p2 p3 q3 q1 q2 S1 S2 median m † The closest pair is fp1;p2g, or fq1;q2g, or some fp3;q3g where p3 2 S1 and q3 2 S2. † Key Observation: If m is the dividing coordinate, then p3;q3 must be within – of m. † In 1D, p3 must be the rightmost point of S1 and q3 the leftmost point of S2, but these notions do not ...