Max runnning time is 10! Given any set letters could only be assigned
values of {0,1,...9}.
thanks
Arun prasath N
On Nov 2, 9:43 pm, "Lego Haryanto" <[EMAIL PROTECTED]> wrote:
> A "quicker" brute force (not the one with 10! complexity) is by doing a
> recursion starting from the rightmost digit.
Recursion based on the above 3 stmt won't work .
* how do we know the root in level i , where i belongs to
{0,1,...depth-1} .
It looks like a problem of isomorphism how do we check for it
without constructing a tree.
Arun prasath N
On Nov 3, 3:16 am, Arun <[EMAIL PROTECTED]> wrote:
> i
