changed to private

Thanks :)

Thanks :)

Thanks :)

Changed it

Java: https://www.codewars.com/kumite/5b7eb1017a2013f64500009b?sel=5b7eb1017a2013f64500009b

iirc i just took one of the upvoted C# solutions.
The current solution is working for the expample you posted in the cata discourse

Java: https://www.codewars.com/kumite/5b7ea571cb568801bf000033?sel=5b7ea571cb568801bf000033

Java: https://www.codewars.com/kumite/5b7ea2a3878194a0e6000067?sel=5b7ea2a3878194a0e6000067

Thanks for your feedback. I removed casting from my solution. Can you try again?

Java: https://www.codewars.com/kumite/5b7e9ce0402fb75a3b000023?sel=5b7e9ce0402fb75a3b000023

Java: https://www.codewars.com/kumite/5b7e97f6878194550300002c?sel=5b7e97f6878194550300002c

Java: https://www.codewars.com/kumite/5b7e93f47a0c9d3fdc00013e?sel=5b7e93f47a0c9d3fdc00013e

Java: https://www.codewars.com/kumite/5b7e9057f643c4c4d600010d?sel=5b7e9057f643c4c4d600010d

1. Sum all the digits (for 10 this is 1)
2. Substract the sum from n (this is 10-1)
3. If the new n (10-1) is in the list: return else goto 1.