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.
Implement a ROT13 cipher
Test if a Number is a Palindrome without using any String Operations
Return unique values without sorting
Put m balls into n boxes
Give me Hamming on five, hold the mayo
I'm going to enjoy watching you calculate, Mr Anderson
Return elements unique to either input
Make one vector from two others
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