HF RL Explorer

Task: Sort Array by Levenshtein Distance in JavaScript

Task: Sort Array by Levenshtein Distance in JavaScript: a task in Terminal-Lego-15k (Harbor dataset). Implement a high-performance JavaScript solution that sorts an array of usernames by their Levenshtein Distance relative to a search term. The Levenshtein Distance measures the minimum number of…

The task

Implement a high-performance JavaScript solution that sorts an array of usernames by their Levenshtein Distance relative to a search term. The Levenshtein Distance measures the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one string into another.

Part of PrimeIntellect/Terminal-Lego-15k.