I think that with this kind of problem, you can process in two steps.
A first easy problem with small N (to test perms for example). And a harder problem with big N, which
oblige to find another algorithm.
Check if sorted
Test if a Number is a Palindrome without using any String Operations
Project Euler: Problem 8, Find largest product in a large string of numbers
Scoring for oriented dominoes
Pandigital Multiples of 11 (based on Project Euler 491)
Decimation - Optimized for speed
The Hills Are Alive...
Unique dice configurations
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