{"push_id":2960755702,"size":1,"distinct_size":1,"ref":"refs/heads/challenge-11","head":"77840f1192b1f272649006a3a4d799d3a78b0247","before":"cdce32395ecf341edaab1221c50a08b442f3d1db","commits":[{"sha":"77840f1192b1f272649006a3a4d799d3a78b0247","author":{"name":"awkonecki","email":"0f540a02c3c04c36596a9ced3a4857f099548b58@gmail.com"},"message":"[FTR] Challenge 11 - Max Profit Implementation\n\nFeature Description\n\nBrute force and greedy array implementations for determining the maximum profit\nthat can be obtained from a single buy and sell from a given array of stock\nprices.\n\nRelated Issues\n- #23","distinct":true,"url":"https://api.github.com/repos/awkonecki/ic/commits/77840f1192b1f272649006a3a4d799d3a78b0247"}]}
{"actor":{"display_login":"awkonecki"}}