From Coursera course: Princeton University Algorithms 1 with Robbert Sedgewick and Kevin Wayne.
Uses edu.princeton.cs.algs4.WeightedQuickUnionUF from their free library.
My submission got an 99/100 with backwash resolved. The missing point was due to failing a minor test (I called some functions 2-3 more times in percolationstats than was necessary, however this has no real impact on performance)
Snippit of feedback log: Count calls to StdStats.mean() and StdStats.stddev() calls StdStats.mean() the wrong number of times - number of student calls to StdStats.mean() = 2 - number of reference calls to StdStats.mean() = 1 - calls StdStats.stddev().