{"push_id":751663742,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"3e158f2df278b1e96186496a718547136aabf655","before":"49b60fc88eb8925b17ebcbcaa7dff0b61fe2274a","commits":[{"sha":"3e158f2df278b1e96186496a718547136aabf655","author":{"email":"a5387e065bd7f04c6e79e0c35ebf589563da3cb6@umbc.edu","name":"Kameron Robinson"},"message":"Some math based algorithms\n\nFindersKeepers: I kind took the easy way, but its more efficient than\n.some() if you ask me.\n\nsmallestCommon: I found the difference and ordered to max and min then\nflagged possibles\n\nsteamRoller: Gosh, steamRoller… I had to use isArray to check my index,\nthen if true I concerted a new recursive call to the same index in the\narr and passed it to newArr, otherwise I pushed that index to new arr.\nSeems easier when You have the solution…","distinct":true,"url":"https://api.github.com/repos/RobinsonKameron/jsAlgo/commits/3e158f2df278b1e96186496a718547136aabf655"}]}