Naive Solution (Median String Problem with Unbounded Alphabets Median String Problem): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 12:1712:17, 15 February 2023‎ Admin talk contribs‎ 394 bytes +394‎ Created page with "== Time Complexity == {2}^$O(n)$ == Space Complexity == $O(n)$ auxiliary words (Keep track of current string being checked, current best string, and Levenshtein distances (which can be computed recursively using O(n) space)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1965 == Reference =="
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Naive_Solution_(Median_String_Problem_with_Unbounded_Alphabets_Median_String_Problem)"