can anyone give me a hint about this problem
See
http://de.mathworks.com/matlabcentral/about/cody/
http://blogs.mathworks.com/community/2012/02/06/scoring-in-cody/
I found the help for this problem to be a bit circular. In the end, there was a comment from one of the blog posts that mentioned looking at the undocumented mtree code (e.g. 'edit mtree' a the command line). It's a big class, but try looking for the nodesize method and go from there. I don't know if this is how actually how cody comes up with the score, but the number of nodes from mtree works as a solution here.
Find all elements less than 0 or greater than 10 and replace them with NaN
13156 Solvers
Find the two most distant points
1648 Solvers
151 Solvers
Find perfect placement of non-rotating dominoes (easier)
240 Solvers
539 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!