Create n x 2n "mirror" matrix of this type:
For n = 2
m = [ 1 2 2 1
1 2 2 1 ]
For n = 3
m = [ 1 2 3 3 2 1
1 2 3 3 2 1
1 2 3 3 2 1 ]
This problem was fun. I was able to find a better way to solve beat my own solution. Not the best way though. But lot better.
Calculate the Levenshtein distance between two strings
Solve the Sudoku Row
random picture with random colours
Back to basics 25 - Valid variable names
Sum of series IV
Sum of series III
Sum of series VI
Sum of series II
Sum of series I
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