This is (more or less) cribbed from the USC contest winner's solution.
Very fast and very compact solution. Nice usage of complex to calculate distance between points and recursion.
Calculate the Levenshtein distance between two strings
Remove the two elements next to NaN value
Circular Primes (based on Project Euler, problem 35)
The Answer to Life, the Universe, and Everything
USC Fall 2012 ACM : Chemical Analysis
Magic - Faro Shuffle
Crypto Addition - v01
GJam 2017 Kickstart: Leader (Large)
Is 3D point set Co-Planar?
Find the treasures in MATLAB Central and discover how the community can help you!
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