@stellasie I'm terribly sorry for not answering before. I try to respond to questions and comments as soon as possible, but I must have missed yours. Please let me know if I still can help you (even if I'm three months late.)

The short answer is that I don't have a preference for how you solve the task. The function should return true if it's possible in any way. In the example you mention, it clearly is possible.

Well, if you don't know which one to choose, why not try both and see if any of them works out. :-)

Let me know if you need more hints.

This was a perfect test case for me to illustrate my problem. Works fine on everything except for that instance. That said, I don't know how to resolve it in either case.

Thanks stella for your feed :)

Can I ask you to be a bit more specific about the parts that you think were not explained in the description, so to see if I should fix it?

Very interesting challenge which I enjoyed.Just feel that a lot of the 'rules' were not mentioned as part of the description , but had to be discovered which is both good and bad :-)

Thanks

public interface Node {
	Node getNext();
}

That allowed me to code offline. Pretty trivial.

Would have suggested to not include the test to count for the number of zeros for factorial of 100000.That way you could still have written a reasonable solution to your problem without being "forced" to to the wolfram "option"

Would have been nice to know what "Node" class was being used for writing of the test in java.I usually do the exercises offline , but was not able to in this case

Thanks , missed that

char is already a number in Java, don't need to convert to int !