{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":255278790,"defaultBranch":"main","name":"LeetCode","ownerLogin":"liuliuOD","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2020-04-13T09:05:18.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/44393673?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1683690822.0","currentOid":""},"activityList":{"items":[{"before":"9142b3768f94f0e14091d6289adb48a13e6976b5","after":"64b822979ad35e911583f58b40149a6faece769e","ref":"refs/heads/main","pushedAt":"2024-06-21T00:56:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] Grumpy Bookstore Owner - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Python] Grumpy Bookstore Owner - Algorithm [Medium]."}},{"before":"1499c2504f57927ff6fced4763ed3a955487c4fc","after":"9142b3768f94f0e14091d6289adb48a13e6976b5","ref":"refs/heads/main","pushedAt":"2024-06-20T13:56:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Rust] methods to Magnetic Force Between Two Balls - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Rust] methods to Magnetic Force Between Two Balls - Algorithm …"}},{"before":"88f3b11d984f558a4cab80ff66ce28c75c071eec","after":"1499c2504f57927ff6fced4763ed3a955487c4fc","ref":"refs/heads/main","pushedAt":"2024-06-20T12:57:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] Magnetic Force Between Two Balls - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Python] Magnetic Force Between Two Balls - Algorithm [Medium]."}},{"before":"0d3f2af58f0b56cb46534368066037699038b2c4","after":"88f3b11d984f558a4cab80ff66ce28c75c071eec","ref":"refs/heads/main","pushedAt":"2024-06-19T12:33:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] method to Minimum Number Of Days To Make M Bouquets - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Python] method to Minimum Number Of Days To Make M Bouquets - …"}},{"before":"a1998e55a4a34f0fe0c76fdcae4840bd53f44445","after":"0d3f2af58f0b56cb46534368066037699038b2c4","ref":"refs/heads/main","pushedAt":"2024-06-19T12:21:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] Minimum Number Of Days To Make M Bouquets - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Python] Minimum Number Of Days To Make M Bouquets - Algorithm …"}},{"before":"664f372499fe8adb9d85169c330ff6f79b1d0efe","after":"a1998e55a4a34f0fe0c76fdcae4840bd53f44445","ref":"refs/heads/main","pushedAt":"2024-06-18T12:40:57.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Rust] method to Most Profit Assigning Work - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Rust] method to Most Profit Assigning Work - Algorithm [Medium]."}},{"before":"6e76b2476fe5640eec97faa8443a80cafaaf348a","after":"664f372499fe8adb9d85169c330ff6f79b1d0efe","ref":"refs/heads/main","pushedAt":"2024-06-17T13:42:57.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Rust] method to Sum Of Square Numbers - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Rust] method to Sum Of Square Numbers - Algorithm [Medium]."}},{"before":"542c2f67af6a06018b72c55eb8c947221d4ccf31","after":"6e76b2476fe5640eec97faa8443a80cafaaf348a","ref":"refs/heads/main","pushedAt":"2024-06-17T13:07:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] method to Sum Of Square Numbers - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Python] method to Sum Of Square Numbers - Algorithm [Medium]."}},{"before":"2aaf004be1235298f2fcf03c6de348d82c9d69dc","after":"542c2f67af6a06018b72c55eb8c947221d4ccf31","ref":"refs/heads/main","pushedAt":"2024-06-17T00:57:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] Sum Of Square Numbers - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Python] Sum Of Square Numbers - Algorithm [Medium]."}},{"before":"6a2ad13f5c83cb20fa96cf080fb941e5e3305325","after":"2aaf004be1235298f2fcf03c6de348d82c9d69dc","ref":"refs/heads/main","pushedAt":"2024-06-16T10:21:33.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] methods to Patching Array - Algorithm [Hard].","shortMessageHtmlLink":"[Add] [Python] methods to Patching Array - Algorithm [Hard]."}},{"before":"f64a70e56806b1756ddc0d3c947e44e7dc7160bd","after":"6a2ad13f5c83cb20fa96cf080fb941e5e3305325","ref":"refs/heads/main","pushedAt":"2024-06-15T13:41:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Rust] methods to IPO - Algorithm [Hard].","shortMessageHtmlLink":"[Add] [Rust] methods to IPO - Algorithm [Hard]."}},{"before":"016d2f3002a601381541bfbd38c2f1e157964232","after":"f64a70e56806b1756ddc0d3c947e44e7dc7160bd","ref":"refs/heads/main","pushedAt":"2024-06-15T01:06:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] IPO - Algorithm [Hard].","shortMessageHtmlLink":"[Add] [Python] IPO - Algorithm [Hard]."}},{"before":"f03307fbc5567b0b0ce3b8d7c344ddd500e2c143","after":"016d2f3002a601381541bfbd38c2f1e157964232","ref":"refs/heads/main","pushedAt":"2024-06-14T00:42:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] methods to Minimum Increment To Make Array Unique - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Python] methods to Minimum Increment To Make Array Unique - Al…"}},{"before":"2c9464f99a24ba4dc5bf5689ae5f51e8e21d8927","after":"f03307fbc5567b0b0ce3b8d7c344ddd500e2c143","ref":"refs/heads/main","pushedAt":"2024-06-14T00:35:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] Minimum Increment To Make Array Unique - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Python] Minimum Increment To Make Array Unique - Algorithm [Me…"}},{"before":"07ee98b8367a21fff9a41dea7e645f5f80cada55","after":"2c9464f99a24ba4dc5bf5689ae5f51e8e21d8927","ref":"refs/heads/main","pushedAt":"2024-06-13T13:03:32.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Rust] methods to Minimum Number Of Moves To Seat Everyone - Algorithm [Easy].","shortMessageHtmlLink":"[Add] [Rust] methods to Minimum Number Of Moves To Seat Everyone - Al…"}},{"before":"e7235fe03847e37914cdf076048a494c4ffda1db","after":"07ee98b8367a21fff9a41dea7e645f5f80cada55","ref":"refs/heads/main","pushedAt":"2024-06-13T00:37:19.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] methods to Minimum Number Of Moves To Seat Everyone - Algorithm [Easy].","shortMessageHtmlLink":"[Add] [Python] methods to Minimum Number Of Moves To Seat Everyone - …"}},{"before":"83d03554f176f100edc2e276512901727999075b","after":"e7235fe03847e37914cdf076048a494c4ffda1db","ref":"refs/heads/main","pushedAt":"2024-06-12T14:25:20.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Rust] method to Sort Colors - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Rust] method to Sort Colors - Algorithm [Medium]."}},{"before":"ffbfa06e43ce080ae6d93151f4fb9560a30fe253","after":"83d03554f176f100edc2e276512901727999075b","ref":"refs/heads/main","pushedAt":"2024-06-11T12:28:00.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Rust] method to Relative Sort Array - Algorithm [Easy].","shortMessageHtmlLink":"[Add] [Rust] method to Relative Sort Array - Algorithm [Easy]."}},{"before":"b46fa2fb0279842bd16d1e66a411c67f68f219f9","after":"ffbfa06e43ce080ae6d93151f4fb9560a30fe253","ref":"refs/heads/main","pushedAt":"2024-06-11T12:06:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] method to Relative Sort Array - Algorithm [Easy].","shortMessageHtmlLink":"[Add] [Python] method to Relative Sort Array - Algorithm [Easy]."}},{"before":"a87401cdaab79d738b10fc22b25eeb3ac3cd0908","after":"b46fa2fb0279842bd16d1e66a411c67f68f219f9","ref":"refs/heads/main","pushedAt":"2024-06-11T00:56:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] Relative Sort Array - Algorithm [Easy].","shortMessageHtmlLink":"[Add] [Python] Relative Sort Array - Algorithm [Easy]."}},{"before":"ab0e7aaa6931169ec8125526dfed7440d43b6120","after":"a87401cdaab79d738b10fc22b25eeb3ac3cd0908","ref":"refs/heads/main","pushedAt":"2024-06-10T03:08:25.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] method to Height Checker - Algorithm [Easy].","shortMessageHtmlLink":"[Add] [Python] method to Height Checker - Algorithm [Easy]."}},{"before":"6a06a8e882e707c6b553814be3094a43584b6abd","after":"ab0e7aaa6931169ec8125526dfed7440d43b6120","ref":"refs/heads/main","pushedAt":"2024-06-10T02:15:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] Height Checker - Algorithm [Easy].","shortMessageHtmlLink":"[Add] [Python] Height Checker - Algorithm [Easy]."}},{"before":"aece027078dd0b3492f28e2f263eb913b51dbd9c","after":"6a06a8e882e707c6b553814be3094a43584b6abd","ref":"refs/heads/main","pushedAt":"2024-06-09T04:41:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Rust] method to Subarray Sums Divisible By K - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Rust] method to Subarray Sums Divisible By K - Algorithm [Medi…"}},{"before":"f732ba28417efec39063a61621f614e1fa9de8a1","after":"aece027078dd0b3492f28e2f263eb913b51dbd9c","ref":"refs/heads/main","pushedAt":"2024-06-09T04:17:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] method to Subarray Sums Divisible By K - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Python] method to Subarray Sums Divisible By K - Algorithm [Me…"}},{"before":"3987d7a9881086f5a56b3c5161c380c7d72ee8e9","after":"f732ba28417efec39063a61621f614e1fa9de8a1","ref":"refs/heads/main","pushedAt":"2024-06-08T08:23:20.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] Continuous Subarray Sum - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Python] Continuous Subarray Sum - Algorithm [Medium]."}},{"before":"8ce9c5c13783f42e2767c9903f5e27348af1781e","after":"3987d7a9881086f5a56b3c5161c380c7d72ee8e9","ref":"refs/heads/main","pushedAt":"2024-06-07T14:05:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] methods to Replace Words - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Python] methods to Replace Words - Algorithm [Medium]."}},{"before":"6538e351901e8cf3d1912310f340bc0e2d4ce229","after":"8ce9c5c13783f42e2767c9903f5e27348af1781e","ref":"refs/heads/main","pushedAt":"2024-06-07T00:47:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] Replace Words - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Python] Replace Words - Algorithm [Medium]."}},{"before":"d987761f7d57c9c86077dc2401352b10459a3b6b","after":"6538e351901e8cf3d1912310f340bc0e2d4ce229","ref":"refs/heads/main","pushedAt":"2024-06-06T01:02:22.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] Hand Of Straights - Algorithm [Medium].","shortMessageHtmlLink":"[Add] [Python] Hand Of Straights - Algorithm [Medium]."}},{"before":"5f6a013af5a1d809310fbb04c72bffc7508cc5e5","after":"d987761f7d57c9c86077dc2401352b10459a3b6b","ref":"refs/heads/main","pushedAt":"2024-06-05T17:56:56.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Python] Find Subarray With Bitwise AND Closest To K - Algorithm [Hard].","shortMessageHtmlLink":"[Add] [Python] Find Subarray With Bitwise AND Closest To K - Algorith…"}},{"before":"a871b8ff85c654fedfd2483226f27f41a4a95475","after":"5f6a013af5a1d809310fbb04c72bffc7508cc5e5","ref":"refs/heads/main","pushedAt":"2024-06-05T13:15:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"liuliuOD","name":"liuliu","path":"/liuliuOD","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/44393673?s=80&v=4"},"commit":{"message":"[Add] [Rust] method to Find Common Characters - Algorithm [Easy].","shortMessageHtmlLink":"[Add] [Rust] method to Find Common Characters - Algorithm [Easy]."}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEaxqFTAA","startCursor":null,"endCursor":null}},"title":"Activity · liuliuOD/LeetCode"}