It should be noted that spaces should be ignored or else test suites 3 and 5 fail.
good use of 'hankel' function
Sorry about this, but I got stuck and I want to learn how to do it. After looking at several solutions, I found my mistake and was able to create my own solution :)
What happens if the test suite changed in the future?
This solution is not correct in general, as the way of using hankel here, generates n-1 fake fragments
Clever usage of the Hankel matrix. I don't automatically think of the Hankel for this application, but it really works well. Thanks - I've learned something
What's the point of a 'solution' like this? It passes the test suite, but in what way was it interesting for you to write it?
Solve the Sudoku Row
Back to basics 22 - Rotate a matrix
Sum of diagonal of a square matrix
Sum the Digits of a Number
The Goldbach Conjecture, Part 2
It dseon't mettar waht oedrr the lrettes in a wrod are.
Return the 3n+1 sequence for n
Find the longest sequence of 1's in a binary sequence.
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office