Colletions are general-purpose or specialized data structures in which elements store.
Calculate Hamming distance to two unsigned intergers.
Calculate Hamming distance of two UTF-8 encoded strings.
Calculate Levenshtein distance for two UTF-8 encoded strings.
Naïvely calculate Levenshtein distance using the whole distance matrix to store information for all substrings.