Studio

by Internal Labs

<100

Levenshtein Distance calculates the minimum edits (insertions, deletions, substitutions) to transform one string into another. Used in spell check, fuzzy search; runs in 𝑂 ( 𝑛 × 𝑚 ) O(n×m) time.

by Internal Labs

<100

Hamming Distance measures the difference between two equal-length strings by counting differing positions. It's used in error detection, genomics, and text comparison to assess string similarity.