{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":437480046,"defaultBranch":"main","name":"leetcode_practice","ownerLogin":"allen870619","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2021-12-12T07:24:19.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/32888552?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1639293974.595477","currentOid":""},"activityList":{"items":[{"before":"865147d58331a3ca48f7b12d11d2f8fe6507d970","after":"145469f72774cc165dc673818bef12ac151a8edb","ref":"refs/heads/main","pushedAt":"2023-05-01T01:23:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"1491. Average Salary Excluding the Minimum and Maximum SalaryChanging duration compute method","shortMessageHtmlLink":"1491. Average Salary Excluding the Minimum and Maximum SalaryChanging…"}},{"before":"a471071b035f6a4baecf8fd90562adafbcf11586","after":"865147d58331a3ca48f7b12d11d2f8fe6507d970","ref":"refs/heads/main","pushedAt":"2023-04-07T03:35:57.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"1020. Number of Enclaves","shortMessageHtmlLink":"1020. Number of Enclaves"}},{"before":"9fc828d8079e9f1a32502bac02ea51d74a2cc3e1","after":"a471071b035f6a4baecf8fd90562adafbcf11586","ref":"refs/heads/main","pushedAt":"2023-04-07T03:20:00.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"430. Flatten a Multilevel Doubly Linked List","shortMessageHtmlLink":"430. Flatten a Multilevel Doubly Linked List"}},{"before":"0383bee9eb85831445d9af63050e9db5519c47fd","after":"9fc828d8079e9f1a32502bac02ea51d74a2cc3e1","ref":"refs/heads/main","pushedAt":"2023-03-23T01:49:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"662. Maximum Width of Binary Tree","shortMessageHtmlLink":"662. Maximum Width of Binary Tree"}},{"before":"b3b3e1fe36dba3693c4d26077c2bd4921bb4f9e4","after":"0383bee9eb85831445d9af63050e9db5519c47fd","ref":"refs/heads/main","pushedAt":"2023-03-17T02:25:13.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"208. Implement Trie","shortMessageHtmlLink":"208. Implement Trie"}},{"before":"3f7b6ca76fa2438dd63a58264e1968ffc53456a5","after":"b3b3e1fe36dba3693c4d26077c2bd4921bb4f9e4","ref":"refs/heads/main","pushedAt":"2023-03-15T12:58:31.851Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"958. Check Completeness of a Binary Tree","shortMessageHtmlLink":"958. Check Completeness of a Binary Tree"}},{"before":"4d8e0898bd652d96a8dc1d4009795ee7c6629703","after":"3f7b6ca76fa2438dd63a58264e1968ffc53456a5","ref":"refs/heads/main","pushedAt":"2023-03-14T00:42:27.257Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"129. Sum Root to Leaf Numbers","shortMessageHtmlLink":"129. Sum Root to Leaf Numbers"}},{"before":"cd591028c3fe2c38d7b1604274849a6c0025f48e","after":"4d8e0898bd652d96a8dc1d4009795ee7c6629703","ref":"refs/heads/main","pushedAt":"2023-03-13T02:25:50.999Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"101. Symmetric Tree","shortMessageHtmlLink":"101. Symmetric Tree"}},{"before":"df3622d9f00971b2f8627b335e88a74f53242223","after":"cd591028c3fe2c38d7b1604274849a6c0025f48e","ref":"refs/heads/main","pushedAt":"2023-03-12T13:30:17.676Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"23. Merge k Sorted Lists","shortMessageHtmlLink":"23. Merge k Sorted Lists"}},{"before":"e5466b3800c6dffb419e0c3a9118182791c6e073","after":"df3622d9f00971b2f8627b335e88a74f53242223","ref":"refs/heads/main","pushedAt":"2023-03-11T13:46:54.341Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"1344. Angle Between Hands of a Clock","shortMessageHtmlLink":"1344. Angle Between Hands of a Clock"}},{"before":"b87bbdb9e5c073d50ef48b69ff364c602909436b","after":"e5466b3800c6dffb419e0c3a9118182791c6e073","ref":"refs/heads/main","pushedAt":"2023-03-11T13:27:45.452Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"140. Word Break II\n461. Hamming Distance","shortMessageHtmlLink":"140. Word Break II"}},{"before":"a5d9d441a16c8fd1a920bc8485f00ee83461bb34","after":"b87bbdb9e5c073d50ef48b69ff364c602909436b","ref":"refs/heads/main","pushedAt":"2023-03-11T12:16:17.673Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"107. Binary Tree Level Order Traversal II DFS","shortMessageHtmlLink":"107. Binary Tree Level Order Traversal II DFS"}},{"before":"547f499b520bbb9f2b4b8b5da04e2ba92621d0fd","after":"a5d9d441a16c8fd1a920bc8485f00ee83461bb34","ref":"refs/heads/main","pushedAt":"2023-03-11T01:52:58.824Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"109. Convert Sorted List to Binary Search Tree","shortMessageHtmlLink":"109. Convert Sorted List to Binary Search Tree"}},{"before":"4f90d9e9c1f5a192d7990f615a00d5a89d892fe7","after":"547f499b520bbb9f2b4b8b5da04e2ba92621d0fd","ref":"refs/heads/main","pushedAt":"2023-03-10T01:33:01.047Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"382. Linked List Random Node","shortMessageHtmlLink":"382. Linked List Random Node"}},{"before":"a349fc9c6a624e0b831a8fb694b4150526f9b3e8","after":"4f90d9e9c1f5a192d7990f615a00d5a89d892fe7","ref":"refs/heads/main","pushedAt":"2023-03-08T02:49:00.826Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"207. Course Schedule\n630. Course Schedule III\n875. Koko Eating Bananas","shortMessageHtmlLink":"207. Course Schedule"}},{"before":"d97c106699b66ed005c8f7ddfab415768d881e06","after":"a349fc9c6a624e0b831a8fb694b4150526f9b3e8","ref":"refs/heads/main","pushedAt":"2023-03-07T11:33:50.940Z","pushType":"push","commitsCount":1,"pusher":{"login":"allen870619","name":"Allen Lee","path":"/allen870619","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/32888552?s=80&v=4"},"commit":{"message":"153. Find Minimum in Rotated Sorted Array\n154. Find Minimum in Rotated Sorted Array II","shortMessageHtmlLink":"153. Find Minimum in Rotated Sorted Array"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAADI2DkTAA","startCursor":null,"endCursor":null}},"title":"Activity · allen870619/leetcode_practice"}