{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":329227196,"defaultBranch":"main","name":"Searching-And-Sorting-DSA-Series","ownerLogin":"Himanshu3198","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2021-01-13T07:27:23.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/54854216?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1632755550.274709","currentOid":""},"activityList":{"items":[{"before":"d66e374edcb6d0befc17604eb5d07c6b01c3ddad","after":"de7bb19b373b73da247a1787ff6fb413b0d56a17","ref":"refs/heads/main","pushedAt":"2024-05-27T07:42:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Himanshu3198","name":"HIMANSHU SHARMA","path":"/Himanshu3198","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54854216?s=80&v=4"},"commit":{"message":"Create BinarySearchOnAsnwer-ScheduleManagement.cpp\n\ncodeforces problem c","shortMessageHtmlLink":"Create BinarySearchOnAsnwer-ScheduleManagement.cpp"}},{"before":"574c60a85631f1fcac214ba64c337322937aec16","after":"d66e374edcb6d0befc17604eb5d07c6b01c3ddad","ref":"refs/heads/main","pushedAt":"2023-08-16T19:14:53.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Himanshu3198","name":"HIMANSHU SHARMA","path":"/Himanshu3198","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54854216?s=80&v=4"},"commit":{"message":"Create Binary-search-1870. Minimum Speed to Arrive on Time.cpp","shortMessageHtmlLink":"Create Binary-search-1870. Minimum Speed to Arrive on Time.cpp"}},{"before":"b59bfcf08cdf70b03af6ade23147d14abb5439f9","after":"574c60a85631f1fcac214ba64c337322937aec16","ref":"refs/heads/main","pushedAt":"2023-07-30T19:04:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Himanshu3198","name":"HIMANSHU SHARMA","path":"/Himanshu3198","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54854216?s=80&v=4"},"commit":{"message":"Create Maximum Beauty of an Array After Applying Operation.cpp","shortMessageHtmlLink":"Create Maximum Beauty of an Array After Applying Operation.cpp"}},{"before":"616e7d12d845cfc5f2d32dd0cedbf6328d2850bf","after":"b59bfcf08cdf70b03af6ade23147d14abb5439f9","ref":"refs/heads/main","pushedAt":"2023-07-30T19:02:13.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Himanshu3198","name":"HIMANSHU SHARMA","path":"/Himanshu3198","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54854216?s=80&v=4"},"commit":{"message":"Create 2271. Maximum White Tiles Covered by a Carpet.cpp","shortMessageHtmlLink":"Create 2271. Maximum White Tiles Covered by a Carpet.cpp"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEVJ1F2wA","startCursor":null,"endCursor":null}},"title":"Activity · Himanshu3198/Searching-And-Sorting-DSA-Series"}