Problem 196. love is an n-letter word
Given a list of N words, return the N-letter word (choosing one letter from each word) with the property of having the least distance between each pair of two consecutive letters (if there are multiple optimal solutions return any one of them).
Example: s1 = {'abcd','bcde','cdef','defg'}; should return s2 = 'dddd'; (with total letter-distance = 0)
Example: s1={'aldfejk','czoa','vwy','abcde'}; should return s2='love'; (with total letter-distance = 27: 'l'-'o'=3 + 'o'-'v'=7 + 'v'-'e'=17 ; compare for example to the possible word 'aave' which has a total letter-distance of 38)
Solution Stats
Problem Comments
-
5 Comments
@Martijn: I am not sure why that is happening but in the meantime using "diff(double('test'))" should work fine
fixed look-up table hack
good
Solution Comments
Show commentsProblem Recent Solvers48
Suggested Problems
-
Find the peak 3n+1 sequence value
2527 Solvers
-
120 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1301 Solvers
-
342 Solvers
-
Determine if input is a perfect number
242 Solvers
More from this Author38
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!