Project Euler > Problem 172 > Investigating numbers with few repeated digits. (Java Solution)

Problem:

How many 18-digit numbers n (without leading zeros) are there such that no digit occurs more than three times in n?

Solution:

871198282

Code:
The solution may include methods that will be found here: Library.java .

public interface EulerSolution{

public String run();

}

We don't have code for that problem yet! If you solved that out using Java, feel free to contribute it to our website, using our "Upload" form.