Cody

# Problem 196. love is an n-letter word

Solution 58200

Submitted on 8 Mar 2012 by Raphael Cautain
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
%% s1 = {'abcd','bcde','cdef','defg'}; assert(isequal(gobbledigook(s1),'dddd')) s2_correct = 'dddd';

2   Pass
%% s1 = {'aldfejk','czoa','vwy','abcde'}; assert(isequal(gobbledigook(s1),'love')) s2_correct = 'love';

3   Pass
%% s1 = {'some','help','check','viterbi','algorithm'}; assert(isequal(gobbledigook(s1),'eeeeg')) s2_correct = 'eeeeg';

4   Pass
%% s1 = {'ldjfac','deamv','fka','idlw','pqmfjavs'}; assert(isequal(gobbledigook(s1),'lmklm')|isequal(gobbledigook(s1),'aaadf')) s2_correct = 'lmklm'; s2_correct = 'aaadf';

5   Pass
%% % avoids look-up table hack s1 = cellfun(@(x)char('a'-1+randi(26,1,5)),cell(1,7),'uniformoutput',false); assert(all(any(bsxfun(@eq,gobbledigook(s1),cell2mat(cellfun(@(x)x',s1,'uniformoutput',false)))))&all(sum(abs(diff(double(gobbledigook(s1)))))<=sum(abs(diff(double(cell2mat(cellfun(@(x)x(randi(numel(x),1,1000))',s1,'uniformoutput',false))),1,2)),2)));