{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":367854398,"defaultBranch":"main","name":"leetcode-swift","ownerLogin":"sergeyleschev","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2021-05-16T10:56:19.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/23653372?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1621162580.578351","currentOid":""},"activityList":{"items":[{"before":"6940dc60738e2a64e045556b43bfb3df0a728d98","after":"e4a82ccf5b1e0240956df7f0bc17cecc2f02dd56","ref":"refs/heads/main","pushedAt":"2024-05-23T04:52:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"1174. Immediate Food Delivery II","shortMessageHtmlLink":"1174. Immediate Food Delivery II"}},{"before":"a522ea324f70082c3cb47e80a00c3855cd790642","after":"6940dc60738e2a64e045556b43bfb3df0a728d98","ref":"refs/heads/main","pushedAt":"2024-04-06T06:57:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"22. Generate Parentheses","shortMessageHtmlLink":"22. Generate Parentheses"}},{"before":"9b712a2769dfd335b7a757b21dc411e3fbd6cbf0","after":"a522ea324f70082c3cb47e80a00c3855cd790642","ref":"refs/heads/main","pushedAt":"2024-02-18T15:08:47.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2996. Smallest Missing Integer Greater Than Sequential Prefix Sum","shortMessageHtmlLink":"2996. Smallest Missing Integer Greater Than Sequential Prefix Sum"}},{"before":"04f99d7e0493cfc9725f2d685fa4e4ed778f32ea","after":"9b712a2769dfd335b7a757b21dc411e3fbd6cbf0","ref":"refs/heads/main","pushedAt":"2024-01-07T17:57:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2982. Find Longest Special Substring That Occurs Thrice II","shortMessageHtmlLink":"2982. Find Longest Special Substring That Occurs Thrice II"}},{"before":"1e50cb189f56b74f5f81d1357e9c04d6359750c8","after":"04f99d7e0493cfc9725f2d685fa4e4ed778f32ea","ref":"refs/heads/main","pushedAt":"2024-01-07T17:55:28.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2981. Find Longest Special Substring That Occurs Thrice I","shortMessageHtmlLink":"2981. Find Longest Special Substring That Occurs Thrice I"}},{"before":"7b62dc7505eeabd3ecf23448121adb6d5823d017","after":"1e50cb189f56b74f5f81d1357e9c04d6359750c8","ref":"refs/heads/main","pushedAt":"2024-01-07T17:52:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2980. Check if Bitwise OR Has Trailing Zeros","shortMessageHtmlLink":"2980. Check if Bitwise OR Has Trailing Zeros"}},{"before":"292c6d18cc3f1b9a8a43cccdc5e8476e8143b2cb","after":"7b62dc7505eeabd3ecf23448121adb6d5823d017","ref":"refs/heads/main","pushedAt":"2024-01-07T17:44:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2976. Minimum Cost to Convert String I","shortMessageHtmlLink":"2976. Minimum Cost to Convert String I"}},{"before":"1f4eb224b08af337a134e5d2319499cd0c8ce06e","after":"292c6d18cc3f1b9a8a43cccdc5e8476e8143b2cb","ref":"refs/heads/main","pushedAt":"2024-01-07T17:35:58.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2975. Maximum Square Area by Removing Fences From a Field","shortMessageHtmlLink":"2975. Maximum Square Area by Removing Fences From a Field"}},{"before":"cfe6316ff628c983f26b0eb602aab551d22f00d2","after":"1f4eb224b08af337a134e5d2319499cd0c8ce06e","ref":"refs/heads/main","pushedAt":"2024-01-07T17:34:07.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2974. Minimum Number Game","shortMessageHtmlLink":"2974. Minimum Number Game"}},{"before":"1e0e4bb0ff406cebc188836662903c8448be8758","after":"cfe6316ff628c983f26b0eb602aab551d22f00d2","ref":"refs/heads/main","pushedAt":"2024-01-07T17:31:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2973. Find Number of Coins to Place in Tree Nodes","shortMessageHtmlLink":"2973. Find Number of Coins to Place in Tree Nodes"}},{"before":"8ec751a5a37eabadec0914cbe41a7213b0d9a24e","after":"1e0e4bb0ff406cebc188836662903c8448be8758","ref":"refs/heads/main","pushedAt":"2024-01-07T17:29:40.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2972. Count the Number of Incremovable Subarrays II","shortMessageHtmlLink":"2972. Count the Number of Incremovable Subarrays II"}},{"before":"51ffdc16a12361dcc8143573fa40836869b4d1b6","after":"8ec751a5a37eabadec0914cbe41a7213b0d9a24e","ref":"refs/heads/main","pushedAt":"2024-01-07T17:26:56.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2971. Find Polygon With the Largest Perimeter","shortMessageHtmlLink":"2971. Find Polygon With the Largest Perimeter"}},{"before":"a6ea58538bcc1b4f5f7daf1cf71f7e4890c6b58d","after":"51ffdc16a12361dcc8143573fa40836869b4d1b6","ref":"refs/heads/main","pushedAt":"2024-01-07T17:23:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2970. Count the Number of Incremovable Subarrays I","shortMessageHtmlLink":"2970. Count the Number of Incremovable Subarrays I"}},{"before":"09214dfa7503c1c350c460c36fd7f68900bd1b31","after":"a6ea58538bcc1b4f5f7daf1cf71f7e4890c6b58d","ref":"refs/heads/main","pushedAt":"2024-01-07T08:22:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2968. Apply Operations to Maximize Frequency Score","shortMessageHtmlLink":"2968. Apply Operations to Maximize Frequency Score"}},{"before":"3ed21c045a66007ca69150468805d392c9601e71","after":"09214dfa7503c1c350c460c36fd7f68900bd1b31","ref":"refs/heads/main","pushedAt":"2024-01-07T08:19:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2967. Minimum Cost to Make Array Equalindromic","shortMessageHtmlLink":"2967. Minimum Cost to Make Array Equalindromic"}},{"before":"a379badaa3a5c2c99aa1224404dfdeb20abfaf87","after":"3ed21c045a66007ca69150468805d392c9601e71","ref":"refs/heads/main","pushedAt":"2024-01-07T08:16:06.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2966. Divide Array Into Arrays With Max Difference","shortMessageHtmlLink":"2966. Divide Array Into Arrays With Max Difference"}},{"before":"679c342efe58df12d3cbe65e60d5211260953164","after":"a379badaa3a5c2c99aa1224404dfdeb20abfaf87","ref":"refs/heads/main","pushedAt":"2024-01-07T08:08:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2965. Find Missing and Repeated Values","shortMessageHtmlLink":"2965. Find Missing and Repeated Values"}},{"before":"4e645a346fee8870aea797b5d50a36e8a41d0c70","after":"679c342efe58df12d3cbe65e60d5211260953164","ref":"refs/heads/main","pushedAt":"2024-01-07T08:07:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2965. Find Missing and Repeated Values","shortMessageHtmlLink":"2965. Find Missing and Repeated Values"}},{"before":"27ce0493a2dcd3fa41cde412215300c5d2a07f72","after":"4e645a346fee8870aea797b5d50a36e8a41d0c70","ref":"refs/heads/main","pushedAt":"2024-01-07T08:04:54.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2965. Find Missing and Repeated Values","shortMessageHtmlLink":"2965. Find Missing and Repeated Values"}},{"before":"4b1153759b942144aa38e536c610a685754b7c5e","after":"27ce0493a2dcd3fa41cde412215300c5d2a07f72","ref":"refs/heads/main","pushedAt":"2024-01-07T07:55:53.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2963. Count the Number of Good Partitions","shortMessageHtmlLink":"2963. Count the Number of Good Partitions"}},{"before":"e862f259e9348568cef9330f1db13601d3d0b4e3","after":"4b1153759b942144aa38e536c610a685754b7c5e","ref":"refs/heads/main","pushedAt":"2024-01-07T07:55:26.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2963. Count the Number of Good Partitions","shortMessageHtmlLink":"2963. Count the Number of Good Partitions"}},{"before":"0c65c47c9b0afc79c3ec5e6de16ef0668ebc281a","after":"e862f259e9348568cef9330f1db13601d3d0b4e3","ref":"refs/heads/main","pushedAt":"2024-01-07T07:51:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2962. Count Subarrays Where Max Element Appears at Least K Times","shortMessageHtmlLink":"2962. Count Subarrays Where Max Element Appears at Least K Times"}},{"before":"4e1ffc459ce329dc8c96ddc88b2c5f107982e2ee","after":"0c65c47c9b0afc79c3ec5e6de16ef0668ebc281a","ref":"refs/heads/main","pushedAt":"2024-01-07T07:49:16.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2961. Double Modular Exponentiation","shortMessageHtmlLink":"2961. Double Modular Exponentiation"}},{"before":"b285da2341efa937745a0c13125db2b1c022d2ba","after":"4e1ffc459ce329dc8c96ddc88b2c5f107982e2ee","ref":"refs/heads/main","pushedAt":"2024-01-07T07:47:07.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2960. Count Tested Devices After Test Operations","shortMessageHtmlLink":"2960. Count Tested Devices After Test Operations"}},{"before":"0d88d74445738b886fe616d36c5378d40b318fb4","after":"b285da2341efa937745a0c13125db2b1c022d2ba","ref":"refs/heads/main","pushedAt":"2024-01-07T07:43:32.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2959. Number of Possible Sets of Closing Branches","shortMessageHtmlLink":"2959. Number of Possible Sets of Closing Branches"}},{"before":"74862c9ac11aecef87ec95de9949ab1d0f5188d6","after":"0d88d74445738b886fe616d36c5378d40b318fb4","ref":"refs/heads/main","pushedAt":"2024-01-07T07:38:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2958. Length of Longest Subarray With at Most K Frequency","shortMessageHtmlLink":"2958. Length of Longest Subarray With at Most K Frequency"}},{"before":"88c1bb166ff469473227060d1ffe5b2bb599f8b4","after":"74862c9ac11aecef87ec95de9949ab1d0f5188d6","ref":"refs/heads/main","pushedAt":"2024-01-07T07:35:58.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2957. Remove Adjacent Almost-Equal Characters","shortMessageHtmlLink":"2957. Remove Adjacent Almost-Equal Characters"}},{"before":"408804130a99f34a48efa194724d96f4042e9464","after":"88c1bb166ff469473227060d1ffe5b2bb599f8b4","ref":"refs/heads/main","pushedAt":"2024-01-07T07:31:49.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2956. Find Common Elements Between Two Arrays","shortMessageHtmlLink":"2956. Find Common Elements Between Two Arrays"}},{"before":"2f43d1af2a7ef8516495bc852d744e739b7b4c26","after":"408804130a99f34a48efa194724d96f4042e9464","ref":"refs/heads/main","pushedAt":"2024-01-07T07:29:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2954. Count the Number of Infection Sequences","shortMessageHtmlLink":"2954. Count the Number of Infection Sequences"}},{"before":"c09c278ceccd674e67d96a76f2d3297102706f79","after":"2f43d1af2a7ef8516495bc852d744e739b7b4c26","ref":"refs/heads/main","pushedAt":"2024-01-07T07:11:07.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sergeyleschev","name":"Sergey Leschev ✓⃝","path":"/sergeyleschev","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/23653372?s=80&v=4"},"commit":{"message":"2952. Minimum Number of Coins to be Added","shortMessageHtmlLink":"2952. Minimum Number of Coins to be Added"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEUZqiwAA","startCursor":null,"endCursor":null}},"title":"Activity · sergeyleschev/leetcode-swift"}