Cody

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

34.75% Correct | 65.25% Incorrect
Last solution submitted on Apr 09, 2019

Problem Comments

Solution Comments

Recent Solvers28

Suggested Problems

More from this Author38