{"push_id":1203263317,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"d42576c73cdf7a405ab2d81a6cb51c7d7b46e0e7","before":"7f21cec2977e6d49fd51604b5eac16d665b144c5","commits":[{"sha":"d42576c73cdf7a405ab2d81a6cb51c7d7b46e0e7","author":{"name":"ClicheofDestiny","email":"f7756781ed1f2243b73096485f389de75a919139@gmail.com"},"message":"Created, solved in nlogn time\n\nOriginally did it naively in n^2, used the sortedness of sets (Binary Index Tree) to achieve nlogn.","distinct":true,"url":"https://api.github.com/repos/ClicheofDestiny/HackerRank/commits/d42576c73cdf7a405ab2d81a6cb51c7d7b46e0e7"}]}
{"actor":{"display_login":"ClicheofDestiny"}}