Implement a ROT13 cipher
Count from 0 to N^M in base N.
Test if a Number is a Palindrome without using any String Operations
Project Euler: Problem 10, Sum of Primes
Code breaker, Part III: Operation Xiangliu
Back to basics: adding comments to your code
Comparison of floating-point numbers (doubles)
Back to basics: throwing errors / exceptions
Make your own Test Suite (part 0)
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