{"push_id":915078935,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c0a3e61aaf9544a4631e8680f2df3d59867b2214","before":"eb8ceb2c27cfafb915535e445550632c7e6e80c7","commits":[{"sha":"c0a3e61aaf9544a4631e8680f2df3d59867b2214","author":{"email":"c6558d4fb89fe81bd13d1d01719a787296916880@gmail.com","name":"Prateek Mathur"},"message":"Corrected Disjoint Set Implementation\nMy disjoint set DS was terribly wrong in its implementation of union. I was modifying a set by merging it with another one, that violated the basic rule of using Sets: never modify a value after inserting it into a Set. I am now creating a new LinkedHashSet which is a union of the two sets, insert it into allSets, and delete set1 and set2","distinct":true,"url":"https://api.github.com/repos/prateekmathur1991/algorithms/commits/c0a3e61aaf9544a4631e8680f2df3d59867b2214"}]}