payload: {"push_id":3574728084,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7719a6d0a82074b4eaf5215f41e0a0869a692935","before":"e18181a5120f6aa14af6b665ec4723a98294c8ec","commits":[{"sha":"7719a6d0a82074b4eaf5215f41e0a0869a692935","author":{"name":"Abhimanyu Varde","email":"e8ca02727e19ed860fcfbc558c544f73f718c850@gmail.com"},"message":"App2.3: Delete Middle Node from a singly linked list. Time Complexity O(N) and using two pointers- one that hops twice as much as the first one.","distinct":true,"url":"https://api.github.com/repos/abhi1561/CTCI/commits/7719a6d0a82074b4eaf5215f41e0a0869a692935"}]}
other: {"actor":{"display_login":"abhi1561"}}