{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":796667492,"defaultBranch":"master","name":"eureka-obst","ownerLogin":"fzhnf","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2024-05-06T11:57:57.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/93417786?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1715252960.0","currentOid":""},"activityList":{"items":[{"before":"09b253163900aab2dcc2e576abf075953e3e2e8c","after":"9520047175920c1a499d2fbe2273be627de90a40","ref":"refs/heads/master","pushedAt":"2024-06-24T15:43:23.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"fzhnf","name":"faiz ahnaf","path":"/fzhnf","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/93417786?s=80&v=4"},"commit":{"message":"refactor: cleaning","shortMessageHtmlLink":"refactor: cleaning"}},{"before":"888c7c03354528299c9f852c8827cc19fa9579a3","after":"09b253163900aab2dcc2e576abf075953e3e2e8c","ref":"refs/heads/master","pushedAt":"2024-05-13T03:55:15.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"ryushix","name":"Rafi Al Ayyubi","path":"/ryushix","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122455865?s=80&v=4"},"commit":{"message":"Merge branch 'master' of https://github.com/fzhnf/eureka-obst","shortMessageHtmlLink":"Merge branch 'master' of <a href=\"https://github.com/fzhnf/eureka-obst\">https://github.com/fzhnf/eureka-obst</a>"}},{"before":"ebee4d62f941354395dc08af3bfe21c94c232312","after":"888c7c03354528299c9f852c8827cc19fa9579a3","ref":"refs/heads/master","pushedAt":"2024-05-12T11:10:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"fzhnf","name":"faiz ahnaf","path":"/fzhnf","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/93417786?s=80&v=4"},"commit":{"message":"fix: negative time because the calculation is swapped, start - finish, now it changed to finish - start","shortMessageHtmlLink":"fix: negative time because the calculation is swapped, start - finish…"}},{"before":"3411a60e7377892c5afb34f95b63cbf4d7812125","after":"ebee4d62f941354395dc08af3bfe21c94c232312","ref":"refs/heads/master","pushedAt":"2024-05-12T08:18:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"fzhnf","name":"faiz ahnaf","path":"/fzhnf","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/93417786?s=80&v=4"},"commit":{"message":"ci: add more word","shortMessageHtmlLink":"ci: add more word"}},{"before":"b51126acf358725968ad75376e98ed80cfabcd4a","after":"3411a60e7377892c5afb34f95b63cbf4d7812125","ref":"refs/heads/master","pushedAt":"2024-05-12T08:03:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"fzhnf","name":"faiz ahnaf","path":"/fzhnf","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/93417786?s=80&v=4"},"commit":{"message":"NICE: tree structure visual, time complexity, * height comparison","shortMessageHtmlLink":"NICE: tree structure visual, time complexity, * height comparison"}},{"before":"1753b4698346b7f91fea3935846cfb2660826c63","after":"b51126acf358725968ad75376e98ed80cfabcd4a","ref":"refs/heads/master","pushedAt":"2024-05-12T01:51:49.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"fzhnf","name":"faiz ahnaf","path":"/fzhnf","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/93417786?s=80&v=4"},"commit":{"message":"feat(WIP): Binary search tree & optimal binary search tree now can print tree in main.py, but still null when search","shortMessageHtmlLink":"feat(WIP): Binary search tree &amp; optimal binary search tree now can pr…"}},{"before":"57feaff276da13cc11193e7c412228c5f1e87652","after":"1753b4698346b7f91fea3935846cfb2660826c63","ref":"refs/heads/master","pushedAt":"2024-05-11T14:14:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"fzhnf","name":"faiz ahnaf","path":"/fzhnf","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/93417786?s=80&v=4"},"commit":{"message":"feat: now you can create optimal version of bst using create optimal binary search tree function, TODO:  implement value variable for node class","shortMessageHtmlLink":"feat: now you can create optimal version of bst using create optimal …"}},{"before":"897d5121eb180431b1d05d7c9731b3553f3d92b0","after":"57feaff276da13cc11193e7c412228c5f1e87652","ref":"refs/heads/master","pushedAt":"2024-05-11T12:35:30.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"fzhnf","name":"faiz ahnaf","path":"/fzhnf","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/93417786?s=80&v=4"},"commit":{"message":"ignore pycache","shortMessageHtmlLink":"ignore pycache"}},{"before":"01856fcb34554f1d8afa04a88753c3c743ae3aa3","after":"897d5121eb180431b1d05d7c9731b3553f3d92b0","ref":"refs/heads/master","pushedAt":"2024-05-11T12:34:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"fzhnf","name":"faiz ahnaf","path":"/fzhnf","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/93417786?s=80&v=4"},"commit":{"message":"ignore pycache","shortMessageHtmlLink":"ignore pycache"}},{"before":"b8b8c2eec87d004b57a5e457859b9a07b32210b7","after":"01856fcb34554f1d8afa04a88753c3c743ae3aa3","ref":"refs/heads/master","pushedAt":"2024-05-11T09:44:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"fzhnf","name":"faiz ahnaf","path":"/fzhnf","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/93417786?s=80&v=4"},"commit":{"message":"fix(WIP): need to get the list of int based from bst nodes, then find the optimal bst from it","shortMessageHtmlLink":"fix(WIP): need to get the list of int based from bst nodes, then find…"}},{"before":"1772f9e7444efd3a8365ae06b2f72f8456dce136","after":"b8b8c2eec87d004b57a5e457859b9a07b32210b7","ref":"refs/heads/master","pushedAt":"2024-05-11T05:30:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"fzhnf","name":"faiz ahnaf","path":"/fzhnf","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/93417786?s=80&v=4"},"commit":{"message":"feat&fix: Print2DUtil for print the tree in terminal, and change Node access modifier to private","shortMessageHtmlLink":"feat&amp;fix: Print2DUtil for print the tree in terminal, and change Node…"}},{"before":null,"after":"1772f9e7444efd3a8365ae06b2f72f8456dce136","ref":"refs/heads/master","pushedAt":"2024-05-09T11:09:20.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"fzhnf","name":"faiz ahnaf","path":"/fzhnf","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/93417786?s=80&v=4"},"commit":{"message":"initial commit with binary search tree","shortMessageHtmlLink":"initial commit with binary search tree"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"Y3Vyc29yOnYyOpK7MjAyNC0wNi0yNFQxNTo0MzoyMy4wMDAwMDBazwAAAARtsbC-","startCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wNi0yNFQxNTo0MzoyMy4wMDAwMDBazwAAAARtsbC-","endCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wNS0wOVQxMTowOToyMC4wMDAwMDBazwAAAARFiE3B"}},"title":"Activity · fzhnf/eureka-obst"}