{"push_id":549108635,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"30b6af8697630dc341a7570bdf1d793de9be71cd","before":"e9a4ff5e17cf59b7ec157d20ef24e0ddc2a63100","commits":[{"sha":"30b6af8697630dc341a7570bdf1d793de9be71cd","author":{"email":"024c5551f478cb034c5add0b18097581d7e5058e@gmail.com","name":"riccardo lorenzon"},"message":"numbersolitary\n\nIn a given array, find the subset of maximal sum in which the distance\nbetween consecutive elements is at most 6.","distinct":true,"url":"https://api.github.com/repos/riccardolorenzon/AdvacedDataStructures/commits/30b6af8697630dc341a7570bdf1d793de9be71cd"}]}