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
456 Solvers
261 Solvers
81 Solvers
How many trades represent all the profit?
520 Solvers
33 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!