Since Cody, I dislike for-loops, but your solution is way simpler than my own algorithm. Mission accomplished...
Nevertheless, I would hope for a non-looped piece of code. Let's see in phase 3.
Which doors are open?
Calculate the Levenshtein distance between two strings
Construct a string from letters and counts
letter yes yes & letter no no
Only once: cleaning up your columns
Wrap a vector, but insert NaN's at the wrap-positions.
Convert nested struct-array to numeric array
Create incremental spiral WITHOUT USING EVAL or FEVAL
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