{"push_id":2516525734,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"cd9d4cb8d99786ca1e89871f072dffb9f73b78a9","before":"f8d91a0cf5afa2cc9f228682e53472579d5aa1f5","commits":[{"sha":"cd9d4cb8d99786ca1e89871f072dffb9f73b78a9","author":{"name":"Alexandru Ionescu","email":"11868f3f3040821638138b4cacc1923e015fb82d@users.noreply.github.com"},"message":"Create Largest Sum Contiguous Subarray","distinct":true,"url":"https://api.github.com/repos/al3xionescu/Geeksforgeeks/commits/cd9d4cb8d99786ca1e89871f072dffb9f73b78a9"}]}
{"actor":{"display_login":"al3xionescu"}}