GoogleHashCode2017
GoogleHashCode2017 copied to clipboard
Assignments for the Google HashCode 2017
Refactor getAllAvailableSteps so it shud get start positions and output slices. If some start position slice hasn't any available steps and it is valid -> remove this slice from start...
Performance measures show huge overhead on logging and getAllAvailableSteps method. The project was run via: ` mvn exec:java -Dexec.mainClass="com.google.hashcode.App"` finished with exeption: [medium.in exeption.txt](https://github.com/LyashenkoGS/GoogleHashCode2017/files/744436/medium.in.exeption.txt) Estimate for the end of refactoring...
Implement [BFS](https://en.wikipedia.org/wiki/Breadth-first_search) algorithm to our problem and describe it in our's wiki. I would like to suggest use draw.io. See #7 for example
All infrastructure issues are almost completed, so it's time to implement the actual algorithm. See [TaskDescription.pdf](https://github.com/LyashenkoGS/GoogleHashCode2017/blob/master/documentation/TaskDescription.pdf). An MVP is an algorithm that slices the [example.in](https://github.com/LyashenkoGS/GoogleHashCode2017/blob/master/inputDataSets/example.in) and passes checks on the...