{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":478918237,"defaultBranch":"master","name":"LeetCode","ownerLogin":"mu8086","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2022-04-07T09:37:13.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/23287497?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1649324234.155915","currentOid":""},"activityList":{"items":[{"before":"d7d2ab52c48a446fe88c91b4de7200e1be2c9b72","after":"66bd869540cf4f447214dc8548100a2c215f19f1","ref":"refs/heads/master","pushedAt":"2024-07-19T17:54:35.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"1380. Lucky Numbers in a Matrix\n\nhttps://leetcode.com/problems/lucky-numbers-in-a-matrix","shortMessageHtmlLink":"1380. Lucky Numbers in a Matrix"}},{"before":"71fa8988009bbbe647efb4d4d2410f988af844af","after":"d7d2ab52c48a446fe88c91b4de7200e1be2c9b72","ref":"refs/heads/master","pushedAt":"2024-07-15T05:54:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"2196. Create Binary Tree From Descriptions\n\nhttps://leetcode.com/problems/create-binary-tree-from-descriptions","shortMessageHtmlLink":"2196. Create Binary Tree From Descriptions"}},{"before":"32a40880b9b15ae5e16ec23a436e039ea9ea8bff","after":"71fa8988009bbbe647efb4d4d2410f988af844af","ref":"refs/heads/master","pushedAt":"2024-07-04T08:34:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"2181. Merge Nodes in Between Zeros\n\nhttps://leetcode.com/problems/merge-nodes-in-between-zeros","shortMessageHtmlLink":"2181. Merge Nodes in Between Zeros"}},{"before":"f26e23c32fc0e339b57ddc3991faeedb03e6239b","after":"32a40880b9b15ae5e16ec23a436e039ea9ea8bff","ref":"refs/heads/master","pushedAt":"2024-07-01T03:36:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"1550. Three Consecutive Odds\n\nhttps://leetcode.com/problems/three-consecutive-odds","shortMessageHtmlLink":"1550. Three Consecutive Odds"}},{"before":"1ee3325628eb01dfac85f72736b09352ef06ef27","after":"f26e23c32fc0e339b57ddc3991faeedb03e6239b","ref":"refs/heads/master","pushedAt":"2024-06-30T09:03:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"2285. Maximum Total Importance of Roads\n\nhttps://leetcode.com/problems/maximum-total-importance-of-roads","shortMessageHtmlLink":"2285. Maximum Total Importance of Roads"}},{"before":"41cdd6f911cb9246e4f3815225d6d8f4c6adce1b","after":"1ee3325628eb01dfac85f72736b09352ef06ef27","ref":"refs/heads/master","pushedAt":"2024-06-27T04:26:10.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"1791. Find Center of Star Graph\n\nhttps://leetcode.com/problems/find-center-of-star-graph","shortMessageHtmlLink":"1791. Find Center of Star Graph"}},{"before":"598fae3c84aff04dbd6f691172e2c3dccef22a33","after":"41cdd6f911cb9246e4f3815225d6d8f4c6adce1b","ref":"refs/heads/master","pushedAt":"2024-06-11T06:11:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"1122. Relative Sort Array\n\nhttps://leetcode.com/problems/relative-sort-array","shortMessageHtmlLink":"1122. Relative Sort Array"}},{"before":"fbf1f9a03285ba3308abfe772d7f5db659d6eab9","after":"598fae3c84aff04dbd6f691172e2c3dccef22a33","ref":"refs/heads/master","pushedAt":"2024-06-10T01:35:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"1051. Height Checker\n\nhttps://leetcode.com/problems/height-checker","shortMessageHtmlLink":"1051. Height Checker"}},{"before":"1594ac9e940a2ecc4cb77c4890d4ccdddd059dc3","after":"fbf1f9a03285ba3308abfe772d7f5db659d6eab9","ref":"refs/heads/master","pushedAt":"2024-06-03T04:50:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"344. Reverse String\n\nhttps://leetcode.com/problems/reverse-string","shortMessageHtmlLink":"344. Reverse String"}},{"before":"13570eb399e3f900450bb962b5e5882ff2902e49","after":"1594ac9e940a2ecc4cb77c4890d4ccdddd059dc3","ref":"refs/heads/master","pushedAt":"2024-06-01T02:06:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"260. Single Number III\n\nhttps://leetcode.com/problems/single-number-iii","shortMessageHtmlLink":"260. Single Number III"}},{"before":"312eb93455f133683f59feab81a690fd2395e018","after":"13570eb399e3f900450bb962b5e5882ff2902e49","ref":"refs/heads/master","pushedAt":"2024-06-01T01:49:26.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"3110. Score of a String\n\nhttps://leetcode.com/problems/score-of-a-string","shortMessageHtmlLink":"3110. Score of a String"}},{"before":"012a425f5d2ac64a7ad46dfe376c9198851c4ece","after":"312eb93455f133683f59feab81a690fd2395e018","ref":"refs/heads/master","pushedAt":"2024-05-16T03:45:22.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"2331. Evaluate Boolean Binary Tree\n\nhttps://leetcode.com/problems/evaluate-boolean-binary-tree","shortMessageHtmlLink":"2331. Evaluate Boolean Binary Tree"}},{"before":"f9219b00dd29cf0cfc4757245020d53e7f497deb","after":"012a425f5d2ac64a7ad46dfe376c9198851c4ece","ref":"refs/heads/master","pushedAt":"2024-05-14T06:56:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"3131. Find the Integer Added to Array I\n\nhttps://leetcode.com/problems/find-the-integer-added-to-array-i","shortMessageHtmlLink":"3131. Find the Integer Added to Array I"}},{"before":"99b24b3b5f7c9b1cdc83e87e672a7eda565dcbf4","after":"f9219b00dd29cf0cfc4757245020d53e7f497deb","ref":"refs/heads/master","pushedAt":"2024-05-07T06:45:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"237. Delete Node in a Linked List\n\nhttps://leetcode.com/problems/delete-node-in-a-linked-list","shortMessageHtmlLink":"237. Delete Node in a Linked List"}},{"before":"dd1bdccd6e2a651e01d04010b3c15d73e7d92d38","after":"99b24b3b5f7c9b1cdc83e87e672a7eda565dcbf4","ref":"refs/heads/master","pushedAt":"2024-05-02T05:13:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"2441. Largest Positive Integer That Exists With Its Negative\n\nhttps://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative","shortMessageHtmlLink":"2441. Largest Positive Integer That Exists With Its Negative"}},{"before":"3070c898e85e246769eb15581770beb5e66cbff1","after":"dd1bdccd6e2a651e01d04010b3c15d73e7d92d38","ref":"refs/heads/master","pushedAt":"2024-04-24T00:13:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"1137. N-th Tribonacci Number\n\nhttps://leetcode.com/problems/n-th-tribonacci-number","shortMessageHtmlLink":"1137. N-th Tribonacci Number"}},{"before":"8cbf599089fbce298f5c10ca6e9d313d7a373cab","after":"3070c898e85e246769eb15581770beb5e66cbff1","ref":"refs/heads/master","pushedAt":"2024-04-16T03:41:33.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"623. Add One Row to Tree\n\nhttps://leetcode.com/problems/add-one-row-to-tree","shortMessageHtmlLink":"623. Add One Row to Tree"}},{"before":"879e48964f47e6d458ab326dcf601dc115966946","after":"8cbf599089fbce298f5c10ca6e9d313d7a373cab","ref":"refs/heads/master","pushedAt":"2024-04-15T06:03:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"129. Sum Root to Leaf Numbers\n\nhttps://leetcode.com/problems/sum-root-to-leaf-numbers","shortMessageHtmlLink":"129. Sum Root to Leaf Numbers"}},{"before":"d6b87f92765ad1ba082a273537770bb0b6d69db3","after":"879e48964f47e6d458ab326dcf601dc115966946","ref":"refs/heads/master","pushedAt":"2024-04-15T06:02:49.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"2073. Time Needed to Buy Tickets\n\nhttps://leetcode.com/problems/time-needed-to-buy-tickets","shortMessageHtmlLink":"2073. Time Needed to Buy Tickets"}},{"before":"f796eb20be89b4b29acd1be2a6031612a1e86a62","after":"d6b87f92765ad1ba082a273537770bb0b6d69db3","ref":"refs/heads/master","pushedAt":"2024-04-05T06:59:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"79. Word Search\n\nhttps://leetcode.com/problems/word-search","shortMessageHtmlLink":"79. Word Search"}},{"before":"79a94ef6ef47da885b9f454891bcc4d9c69a0fee","after":"f796eb20be89b4b29acd1be2a6031612a1e86a62","ref":"refs/heads/master","pushedAt":"2024-04-05T05:13:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"1544. Make The String Great\n\nhttps://leetcode.com/problems/make-the-string-great","shortMessageHtmlLink":"1544. Make The String Great"}},{"before":"1fbbb9bbc95b060eb4e0f4eeffdab08c11a5fc70","after":"79a94ef6ef47da885b9f454891bcc4d9c69a0fee","ref":"refs/heads/master","pushedAt":"2024-03-29T04:34:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"2962. Count Subarrays Where Max Element Appears at Least K Times\n\nhttps://leetcode.com/problems/count-subarrays-where-max-element-appears-at-least-k-times","shortMessageHtmlLink":"2962. Count Subarrays Where Max Element Appears at Least K Times"}},{"before":"01f476c04fbfa6481b9b751c3b0f24818816e6df","after":"1fbbb9bbc95b060eb4e0f4eeffdab08c11a5fc70","ref":"refs/heads/master","pushedAt":"2024-03-28T23:32:35.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"2958. Length of Longest Subarray With at Most K Frequency\n\nhttps://leetcode.com/problems/length-of-longest-subarray-with-at-most-k-frequency/","shortMessageHtmlLink":"2958. Length of Longest Subarray With at Most K Frequency"}},{"before":"388f75c80c706bb72e8650762c82cf6800238c92","after":"01f476c04fbfa6481b9b751c3b0f24818816e6df","ref":"refs/heads/master","pushedAt":"2024-03-25T08:21:54.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"442. Find All Duplicates in an Array\n\nhttps://leetcode.com/problems/find-all-duplicates-in-an-array","shortMessageHtmlLink":"442. Find All Duplicates in an Array"}},{"before":"a7e4aba1e79f6dc85149530982351377b41c2f57","after":"388f75c80c706bb72e8650762c82cf6800238c92","ref":"refs/heads/master","pushedAt":"2024-03-24T01:03:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"287. Find the Duplicate Number\n\nhttps://leetcode.com/problems/find-the-duplicate-number","shortMessageHtmlLink":"287. Find the Duplicate Number"}},{"before":"4e2ad8758115223d6ac5bcae94da9aa857f58464","after":"a7e4aba1e79f6dc85149530982351377b41c2f57","ref":"refs/heads/master","pushedAt":"2024-03-23T12:39:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"move","shortMessageHtmlLink":"move"}},{"before":"c62cd6a4a7a5037e42d9b88774f5b17c62534d3f","after":"4e2ad8758115223d6ac5bcae94da9aa857f58464","ref":"refs/heads/master","pushedAt":"2024-03-23T12:31:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"143. Reorder List\n\nhttps://leetcode.com/problems/reorder-list","shortMessageHtmlLink":"143. Reorder List"}},{"before":"03d7997c4790838ea9fb70816bd8afd0d33fc03c","after":"c62cd6a4a7a5037e42d9b88774f5b17c62534d3f","ref":"refs/heads/master","pushedAt":"2024-03-20T23:21:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold\n\nhttps://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold","shortMessageHtmlLink":"1343. Number of Sub-arrays of Size K and Average Greater than or Equa…"}},{"before":"527a037b270635b87ac5bb43abaef86ef8a2e372","after":"03d7997c4790838ea9fb70816bd8afd0d33fc03c","ref":"refs/heads/master","pushedAt":"2024-03-20T01:17:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"1669. Merge In Between Linked Lists\n\nhttps://leetcode.com/problems/merge-in-between-linked-lists","shortMessageHtmlLink":"1669. Merge In Between Linked Lists"}},{"before":"010d4ceb786a3f5122880121ddc6990995840106","after":"527a037b270635b87ac5bb43abaef86ef8a2e372","ref":"refs/heads/master","pushedAt":"2024-03-19T03:25:10.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"mu8086","name":null,"path":"/mu8086","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23287497?s=80&v=4"},"commit":{"message":"621. Task Scheduler\n\nhttps://leetcode.com/problems/task-scheduler","shortMessageHtmlLink":"621. Task Scheduler"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEhCl46wA","startCursor":null,"endCursor":null}},"title":"Activity · mu8086/LeetCode"}