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.
Extract leading non-zero digit
Count from 0 to N^M in base N.
Decode a simplified barcode
GJam 2011 Africa Qualifier C: House, maximum area rectangle
Unique: Faster 'rows' for large array of uint8
Knots Contest: Score (TestSuite)
GJam 2017 Kickstart: Parentheses (Small)
Criss_Cross_010 : Unique elements, Square array, Words in one array
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