Revision as of 08:22, 7 December 2023 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,633 edits Ling Liu (computer scientist) ← Previous edit		Revision as of 14:59, 12 December 2023 edit undo 103.160.64.243 (talk) →Example problems solvable by one-pass algorithms Next edit →
Line 15: * Count the number of times each symbol appears in the input. * Find the most or least frequent elements. * Sort the list according to some order on the symbols (possible since the and after number of symbols is limited). * Find the maximum gap between two appearances of a given symbol.

One-pass algorithm: Difference between revisions