I actually had one of the 30 matlab solutions you mentioned. Did you have much luck in round1A? Sadly, I did not.
Calculate the Levenshtein distance between two strings
Make a run-length companion vector
Min of a Matrix
Find: Faster Alternatives for Large Sorted/Unique Vectors
GJam 2016 Rd1A: Rank and File (Large)
GJam March 2016 IOW: Polynesiaglot Small
Remove NaNs and numbers adjacent to NaNs
GJam 2014 China Rd A: Library Sorting (Large)
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