payload: {"push_id":4388328958,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"22936222861bef817aed4e3ace3c37902f2cfc82","before":"9d35e95b0cff2a1edca0b1fae0264f9031e7de6d","commits":[{"sha":"e34554cdf74443808840c497c575173df7efee89","author":{"name":"Arsh Mahajan","email":"934ca09ee9636197c2eff02a7650e67eb1d6c5fd@gmail.com"},"message":"Updated Dynamic segment tree\n\nPut up the more time efficient implementation for point update n range sum","distinct":true,"url":"https://api.github.com/repos/fazlerahmanejazi/Competitive-Programming/commits/e34554cdf74443808840c497c575173df7efee89"},{"sha":"22936222861bef817aed4e3ace3c37902f2cfc82","author":{"name":"Fazle Rahman Ejazi","email":"f1060576898326cac2ebe2b922629f31e667af04@gmail.com"},"message":"Merge pull request #1 from Arsh0508/patch-1\n\nUpdated Dynamic segment tree","distinct":true,"url":"https://api.github.com/repos/fazlerahmanejazi/Competitive-Programming/commits/22936222861bef817aed4e3ace3c37902f2cfc82"}]}
other: {"actor":{"display_login":"fazlerahmanejazi"}}