{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":111433269,"defaultBranch":"master","name":"algorithms","ownerLogin":"hansrajdas","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2017-11-20T16:11:02.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/8244993?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1633898196.238901","currentOid":""},"activityList":{"items":[{"before":"02edd611af5c48e0ca97281068a7d48ab7898654","after":"7bfb66dcd54892a909928c82deaead5dfe2295e3","ref":"refs/heads/master","pushedAt":"2024-03-29T20:13:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Update docs in heap programs","shortMessageHtmlLink":"Update docs in heap programs"}},{"before":"bffb31f58e6a32cf6cc50bb8f3f744243b6d6e00","after":"02edd611af5c48e0ca97281068a7d48ab7898654","ref":"refs/heads/master","pushedAt":"2023-12-30T16:41:30.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Heap sort - sort array in descending order (min heap)","shortMessageHtmlLink":"Heap sort - sort array in descending order (min heap)"}},{"before":"968d7e77f5d036b54ee2e1bd7fde71acdca82657","after":"bffb31f58e6a32cf6cc50bb8f3f744243b6d6e00","ref":"refs/heads/master","pushedAt":"2023-12-30T11:45:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Heap sort / max heap in golang","shortMessageHtmlLink":"Heap sort / max heap in golang"}},{"before":"489f2b685f1b73a1a0c7485a6c037a044004e9a6","after":"968d7e77f5d036b54ee2e1bd7fde71acdca82657","ref":"refs/heads/master","pushedAt":"2023-12-29T16:40:37.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Insertion sort in Golang\n\nSigned-off-by: Hansraj Das ","shortMessageHtmlLink":"Insertion sort in Golang"}},{"before":"1b8ef7573bcd19770c0f4f465151348f85be28a4","after":"489f2b685f1b73a1a0c7485a6c037a044004e9a6","ref":"refs/heads/master","pushedAt":"2023-12-29T16:38:57.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Insertion sort in Golang\n\nSigned-off-by: Hansraj Das ","shortMessageHtmlLink":"Insertion sort in Golang"}},{"before":"062c628f5364414b257b7ba67c97999726128237","after":"1b8ef7573bcd19770c0f4f465151348f85be28a4","ref":"refs/heads/master","pushedAt":"2023-12-29T08:58:44.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Bubble sort in golang","shortMessageHtmlLink":"Bubble sort in golang"}},{"before":"c626fce8ffdfc65afbd247cdafd392be75545422","after":"062c628f5364414b257b7ba67c97999726128237","ref":"refs/heads/master","pushedAt":"2023-07-06T16:36:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Simplify edit distance program","shortMessageHtmlLink":"Simplify edit distance program"}},{"before":"cb2f575b5ef04ec065902db137da96f80057b972","after":"c626fce8ffdfc65afbd247cdafd392be75545422","ref":"refs/heads/master","pushedAt":"2023-05-22T20:25:04.463Z","pushType":"push","commitsCount":1,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Binary search template","shortMessageHtmlLink":"Binary search template"}},{"before":"f49c4e4de41f2e2bd8ba09c316aaa5e2d1d1578b","after":"cb2f575b5ef04ec065902db137da96f80057b972","ref":"refs/heads/master","pushedAt":"2023-05-20T16:09:20.152Z","pushType":"push","commitsCount":1,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Rename longest increasing program","shortMessageHtmlLink":"Rename longest increasing program"}},{"before":"11a366199a53ce9d9390a610a9e52a5df6ef93e2","after":"f49c4e4de41f2e2bd8ba09c316aaa5e2d1d1578b","ref":"refs/heads/master","pushedAt":"2023-05-17T19:29:12.564Z","pushType":"push","commitsCount":1,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Remove print and add assert","shortMessageHtmlLink":"Remove print and add assert"}},{"before":"87e862f5616efde3f1946be64acbca003b4cc25a","after":"11a366199a53ce9d9390a610a9e52a5df6ef93e2","ref":"refs/heads/master","pushedAt":"2023-05-16T13:27:58.198Z","pushType":"push","commitsCount":1,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"fix binary search template","shortMessageHtmlLink":"fix binary search template"}},{"before":"1cd4a78193915267b458ddf03959165e54e6878b","after":"87e862f5616efde3f1946be64acbca003b4cc25a","ref":"refs/heads/master","pushedAt":"2023-05-01T14:32:16.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Remove brute force approach for solving `subset with equal sum`\n- Top down approch is added with is simply extension of brute force\n with caching","shortMessageHtmlLink":"Remove brute force approach for solving subset with equal sum"}},{"before":"8d7801073a513ddbb0482c80d48aeb86266eaf94","after":"1cd4a78193915267b458ddf03959165e54e6878b","ref":"refs/heads/master","pushedAt":"2023-05-01T14:18:23.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Update readme for C implementation of selection sort","shortMessageHtmlLink":"Update readme for C implementation of selection sort"}},{"before":"55eba07e7eac076d4ac7563003723ead54253200","after":"8d7801073a513ddbb0482c80d48aeb86266eaf94","ref":"refs/heads/master","pushedAt":"2023-05-01T13:52:01.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Add selection sort implementation in C (#18)\n\n* C implementation of Selection sort\r\n\r\nThis program prompts the user to input the length of an array, loads it with values, and sorts it using selection sort in both ascending and descending order. The maximum length of the array is currently set to 15, but can be changed. The implementation includes functions for loading the array, printing the array, and sorting the array in ascending and descending order.","shortMessageHtmlLink":"Add selection sort implementation in C (#18)"}},{"before":"4328fa0cb068965230e740353e82000f2aed1f3f","after":"55eba07e7eac076d4ac7563003723ead54253200","ref":"refs/heads/master","pushedAt":"2023-04-23T07:54:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Add recursive method to reverse linked list","shortMessageHtmlLink":"Add recursive method to reverse linked list"}},{"before":"574c85d711eefe883c2ba0a0b06519fa636310e0","after":"4328fa0cb068965230e740353e82000f2aed1f3f","ref":"refs/heads/master","pushedAt":"2023-04-17T19:44:06.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Update description","shortMessageHtmlLink":"Update description"}},{"before":"d597dee9559d7ee7f3ffc905c3fd515a5d1bfce5","after":"574c85d711eefe883c2ba0a0b06519fa636310e0","ref":"refs/heads/master","pushedAt":"2023-04-10T19:28:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Add another simple approach for inorder iterative traversal","shortMessageHtmlLink":"Add another simple approach for inorder iterative traversal"}},{"before":"6a0dca0aa0260aa5eb68c7ce81dda62b0b2fcf0d","after":"d597dee9559d7ee7f3ffc905c3fd515a5d1bfce5","ref":"refs/heads/master","pushedAt":"2023-04-10T19:10:29.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hansrajdas","name":"Hansraj Das","path":"/hansrajdas","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/8244993?s=80&v=4"},"commit":{"message":"Rewrite kth smallest from BST","shortMessageHtmlLink":"Rewrite kth smallest from BST"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEIvKPFgA","startCursor":null,"endCursor":null}},"title":"Activity ยท hansrajdas/algorithms"}