Given two strings, find the maximum overlap
Count from 0 to N^M in base N.
Back to basics 1 - Saving
Matrix with different incremental runs
Graph Algorithms - 1 : Length of the largest closed path
birthday on same day of week
Integer Sequence - 1
Integer sequence - 2 : Kolakoski sequence
Yet Another Path Finder
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