{"push_id":3145453564,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"3b228f9963dab6f9758be1dd544093793c7a1fa8","before":"1e88a3b82e47d0bac08d56ec594956b7a6998845","commits":[{"sha":"3b228f9963dab6f9758be1dd544093793c7a1fa8","author":{"name":"Mark Nguyen","email":"7dc568a84325665914a3a880a619fa8f6b3d4db8@comcast.net"},"message":"Compute the maximum values of each subarray of length k","distinct":true,"url":"https://api.github.com/repos/hurricanemark/DailyCodeChallenge/commits/3b228f9963dab6f9758be1dd544093793c7a1fa8"}]}
{"actor":{"display_login":"hurricanemark"}}