I am sure there are other more subtle ways to go about it but this seems about as fast as I can make it for a general brute-force solution (0.11s)
This one seems to work for the large test case, too, although it is not a general solution [for size(p,1)>100 it only tests corner points].
Calculate the Levenshtein distance between two strings
Distance walked 3D
Spot the rectangle
How many trades represent all the profit?
Reading Web Binary Files (jpg,pdf,tiff,png)
Create array of all Distances between two Sets of Points : No Neural Network Toolbox
GJam March 2016 IOW: Password Single
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