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.
Extract leading non-zero digit
Find best domino orientation
Replace Vector Elements
Sum the entries of each column of a matrix which satisfy a logical condition.
Test if a Number is a Palindrome without using any String Operations
Test if two numbers have the same digits
Recurring Cycle Length (Inspired by Project Euler Problem 26)
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