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].
Which values occur exactly three times?
Project Euler: Problem 10, Sum of Primes
Given a window, how many subsets of a vector sum positive
Create an 'arrow-head" matrix
Kryptos - CIA Cypher Sculpture: Vigenere Encryption
Is 3D point set Co-Planar?
PACMAT - G03 Ghosts use minimum path to PACMAT; 3 Lives
Unique: Faster for options 'rows' and 'stable' for large array of uint8
Maximum Intra-Vector Swaps
USC Spring 2013 ACM: Walking on Thin Ice
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