We define a skip sequence as a regularly-spaced list of integers such as might be generated by MATLAB's colon operator. We will call the inter-element increment the stride. So the vector 2:3:17 or [2 5 8 11 14 17] is a six-element skip sequence with stride 3.
Given the vector a, your job is to find the stride associated with the longest skip sequence you can assemble using any of the elements of a in any order. You can assume that stride is positive and unique.
Example:
input a = [1 5 3 11 7 2 4 9] output stride is 2
since from the elements of a we can build the six-element sequence [1 3 5 7 9 11].
this problem is multi-valued. it is equally valid to say that, in the case of the example, the stride associated with the longest skip sequence is -2.
Fair enough. I changed the wording to remove the ambiguity.
I added another test and rescored. It appears that DIST no longer works. The DIST function is from the Neural Networks Toolbox. It shouldn't have worked in the past, but since it did, it played a part in a lot of answers. Sorry for the discontinuity.
Tough !
Two years before understand that the sequence must contain only elements of a :)
I use a cheap for the last one. Any help with the last one?
this new implicit expansion functionality is a great excuse to revisit old problems :)
what does the dist function do?
'dist' just computes the euclidean distance between two lists of vectors (the dimensionality size(dist(a,b)) is the same as size(a*b)). In this case ~dist(a',a+s) is just the same as bsxfun(@eq,a',a+s), the matrix defining a directional graph of the elements of 'a' with distance 's'.
just for completion: the matrix above is nilpotent (with degree lower than the length of the vector a), if you sum all of its powers D=sum_n{C^n} (and this is what polyvalm does) you get a matrix where d(i,j)=1 if i is connected to j in this graph; it you then take the largets column sum of the result (this is what norm(D,1) does) you get the maximum length of a sequence with stride s (across all possible starting nodes in a)...
I am impressed.
i have no idea what dist or dmperm are/do...
wow, very nice double arrayfun
they were once for loops
Back to basics 12 - Input Arguments
441 Solvers
Return elements unique to either input
440 Solvers
Make a random, non-repeating vector.
501 Solvers
Create an n-by-n null matrix and fill with ones certain positions
124 Solvers
Sum of odd numbers in a matrix
198 Solvers