{"push_id":2437113941,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"77838c24070988af26ae85e231c1210a9d5832fb","before":"a91c0e6185bc035fa0f56968477195d4504f73de","commits":[{"sha":"77838c24070988af26ae85e231c1210a9d5832fb","author":{"name":"willi","email":"3396f8610ac2a1ed57679add941a8066af421884@DESKTOP-6ES0JC7"},"message":"#leetcode:\n- Minimum Path Sum\n- Partition Equal Subset Sum\n- Target Sum\n- Unique Path II\n- Unique Path","distinct":true,"url":"https://api.github.com/repos/williampmb/problem-solving-skills/commits/77838c24070988af26ae85e231c1210a9d5832fb"}]}
{"actor":{"display_login":"williampmb"}}