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 commentsGroup

Tough Stuff
- 19 Problems
- 7 Finishers
- Make a function that returns its own character count
- love is an n-letter word
- Reverse Boggle
- Cumulative maximum of an array
- Pattern Recognition 3 - Variable Unit and Array Length (including cell arrays)
- Cumulative minimum of an array
- Find the Final State of an Abelian Sandpile
- Decimation - Optimized for speed
- Construct a "diagAdiag" matrix
- Find vampire numbers
- Math with Roman Numerals
- Find similar sequences
- Given two arrays, find the maximum overlap
- Some Assembly Required
- N-Dimensional Array Slice
- Find the stride of the longest skip sequence
- Create initial basic feasible solution for transportation problems -Minimum Cost Method
- Numbers spiral diagonals (Part 2)
- Find the biggest empty box
Problem Recent Solvers48
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!