I always liked flexible autocomplete where you can type a few letters, even skipping some letters, and it can find the file or word for you.
Your task is to write a function that determines if you can complete a sequence of characters to a given string.
(completes? "a" "autocomplete") ;=> true (completes? "atc" "autocomplete") ;=> true (completes? "hello" "hello") ;=> true (completes? "ll" "hello") ;=> true (completes? "llh" "hello") ;=> false
The rules. The function returns true if all of the following are true (otherwise false):
- The first string contains only letters in the second string.
- The first string's letters are in the same order as in the second string.
Note that this means that you can match any number of letters between typed letters.
Thanks to this site for the problem idea, where it is rated Very Hard in Java. The problem has been modified.
Please submit your solutions as comments on this gist.
To subscribe: https://purelyfunctional.tv/newsletter/