can anyone give me a hint about this problem
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.
Distance walked 2D
Matrix with different incremental runs
Replace multiples of 5 with NaN
Area of an Isoceles Triangle
Inhomogenous Depth Scale Interpolation
N-Dimensional Array Slice
The Dark Side of the Die
English to Pig Latin Translator
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