We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I guess you're using Levenshtein Distance (LD) to compare the word-to-be-corrected with (correct) words in a dictionary. Do you scan the dictionary linearly ( O(n) ), or using some kind of sorting ( O(log(n)) ) or hashing ( O(k) )?
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
A Basic Spell Checker
You are viewing a single comment's thread. Return to all comments →
I guess you're using Levenshtein Distance (LD) to compare the word-to-be-corrected with (correct) words in a dictionary. Do you scan the dictionary linearly ( O(n) ), or using some kind of sorting ( O(log(n)) ) or hashing ( O(k) )?