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.
Back and Forth Rows
Smallest distance between a point and a rectangle
"Low : High - Low : High - Turn around " -- Create a subindices vector
Find number of days
Given a matrix, swap the 2nd & 3rd columns
Sums of Distinct Powers
Singularity v5 (with apologies to the true hack masters)
Hackathon - String version
Community Problem 500!
Diophantine Equations (Inspired by Project Euler, problem 66)
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