{"push_id":2699035626,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"71239c2801c4fe442c3f5d5cab7abe63d47ba2a5","before":"9d374e051207c4f1e66d78bceed6733618ee6b3f","commits":[{"sha":"71239c2801c4fe442c3f5d5cab7abe63d47ba2a5","author":{"name":"Caleb Piekstra","email":"5a6d63df4260ef7a8c661a58b2e75fc447c099d7@up.edu"},"message":"Adding Roads and Libraries solution\n\nThis one wasn't all that difficult. There is another way to solve it as well, by building out the full graph and doing a series of depth first searches. I may at some point write that implementation and see which one ends up being faster. There was one hiccup with the problem, and that was the method signature for roadsAndLibraries provided as starter code. I didn't figure it out for the longest time (really frustrating as my solution was correct) but because the parameters were all int, when trying to return \"n * c_lib\", it was remaining an int and wrapper around beyond MaxInt for int32. So the answer was wrong... but it would have been correct multiplying two longs.","distinct":true,"url":"https://api.github.com/repos/piekstra/MiscProjects/commits/71239c2801c4fe442c3f5d5cab7abe63d47ba2a5"}]}
{"actor":{"display_login":"piekstra"}}