{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":474363961,"defaultBranch":"main","name":"leetcode-typescript","ownerLogin":"sergeyleschev","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2022-03-26T13:59:16.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/23653372?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1690138382.0","currentOid":""},"activityList":{"items":[{"before":"639f0107ed8bb15139fc4d4831d47e8b3031ead4","after":"04d4524775f47f68eeab77b64bac08b33342e4e3","ref":"refs/heads/main","pushedAt":"2024-05-23T04:52:34.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":"87800649bc5ef9a08022c696b68de41408b6bb43","after":"639f0107ed8bb15139fc4d4831d47e8b3031ead4","ref":"refs/heads/main","pushedAt":"2024-05-23T04:36:19.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":"2597. The Number of Beautiful Subsets","shortMessageHtmlLink":"2597. The Number of Beautiful Subsets"}},{"before":"509423c6b105a830d16ced096515d38b70d04510","after":"87800649bc5ef9a08022c696b68de41408b6bb43","ref":"refs/heads/main","pushedAt":"2024-05-19T06:15: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":"3068. Find the Maximum Sum of Node Values","shortMessageHtmlLink":"3068. Find the Maximum Sum of Node Values"}},{"before":"79e6906cd8706c56d058b63b45e5a86bc961d629","after":"509423c6b105a830d16ced096515d38b70d04510","ref":"refs/heads/main","pushedAt":"2024-05-09T05:41:25.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":"2ff4f9c70e3b4c1d0ac5e74353664bf460d9bc46","after":"79e6906cd8706c56d058b63b45e5a86bc961d629","ref":"refs/heads/main","pushedAt":"2024-05-09T05:38: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":"2996. Smallest Missing Integer Greater Than Sequential Prefix Sum","shortMessageHtmlLink":"2996. Smallest Missing Integer Greater Than Sequential Prefix Sum"}},{"before":"a2b4369bfcc2585d86138ece5b402121edc1923a","after":"2ff4f9c70e3b4c1d0ac5e74353664bf460d9bc46","ref":"refs/heads/main","pushedAt":"2024-05-09T05:33: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":"3075. Maximize Happiness of Selected Children","shortMessageHtmlLink":"3075. Maximize Happiness of Selected Children"}},{"before":"b299e349505b3939ed5cca90e4eb38f37547480a","after":"a2b4369bfcc2585d86138ece5b402121edc1923a","ref":"refs/heads/main","pushedAt":"2024-05-09T04:28: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":"3075. Maximize Happiness of Selected Children","shortMessageHtmlLink":"3075. Maximize Happiness of Selected Children"}},{"before":"af38c168233bc8b49427827f8b1020662cc83a5d","after":"b299e349505b3939ed5cca90e4eb38f37547480a","ref":"refs/heads/main","pushedAt":"2024-04-29T05:14: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":"2997. Minimum Number of Operations to Make Array XOR Equal to K","shortMessageHtmlLink":"2997. Minimum Number of Operations to Make Array XOR Equal to K"}},{"before":"723ebb0f86fe8f8ef33257124891afa4a8434b9b","after":"af38c168233bc8b49427827f8b1020662cc83a5d","ref":"refs/heads/main","pushedAt":"2024-03-08T07:20: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":"3005. Count Elements With Maximum Frequency","shortMessageHtmlLink":"3005. Count Elements With Maximum Frequency"}},{"before":"600824c16896abcf549cfd72109ea8a317672afe","after":"723ebb0f86fe8f8ef33257124891afa4a8434b9b","ref":"refs/heads/main","pushedAt":"2024-03-02T11:15:21.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":"42. Trapping Rain Water","shortMessageHtmlLink":"42. Trapping Rain Water"}},{"before":"be4067c86ce8531f6518fdab390d11be331f7ea0","after":"600824c16896abcf549cfd72109ea8a317672afe","ref":"refs/heads/main","pushedAt":"2024-03-02T11:11: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":"41. First Missing Positive","shortMessageHtmlLink":"41. First Missing Positive"}},{"before":"f9dbe9211127e1394704eb943e32617fa9f62911","after":"be4067c86ce8531f6518fdab390d11be331f7ea0","ref":"refs/heads/main","pushedAt":"2024-03-02T11:09: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":"37. Sudoku Solver","shortMessageHtmlLink":"37. Sudoku Solver"}},{"before":"55f151b97ce93d0d7421a44ffff7cff88b56eafb","after":"f9dbe9211127e1394704eb943e32617fa9f62911","ref":"refs/heads/main","pushedAt":"2024-03-02T11:05:46.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":"32. Longest Valid Parentheses","shortMessageHtmlLink":"32. Longest Valid Parentheses"}},{"before":"deafb2efa49241d0330b43b4833d2e6ee3d23977","after":"55f151b97ce93d0d7421a44ffff7cff88b56eafb","ref":"refs/heads/main","pushedAt":"2024-03-02T11:03:42.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":"30. Substring with Concatenation of All Words","shortMessageHtmlLink":"30. Substring with Concatenation of All Words"}},{"before":"c95929a3e7679128ce57abaa5587a729a1319337","after":"deafb2efa49241d0330b43b4833d2e6ee3d23977","ref":"refs/heads/main","pushedAt":"2024-03-02T11:01:31.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":"25. Reverse Nodes in k-Group","shortMessageHtmlLink":"25. Reverse Nodes in k-Group"}},{"before":"1325b1ed416ff33fd93eede648dce1f2194e07ba","after":"c95929a3e7679128ce57abaa5587a729a1319337","ref":"refs/heads/main","pushedAt":"2024-03-02T10:58: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":"23. Merge k Sorted Lists","shortMessageHtmlLink":"23. Merge k Sorted Lists"}},{"before":"aa01318b1fa6a72b9b0115048dbba3b1dad35812","after":"1325b1ed416ff33fd93eede648dce1f2194e07ba","ref":"refs/heads/main","pushedAt":"2024-03-02T10:55:27.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":"10. Regular Expression Matching","shortMessageHtmlLink":"10. Regular Expression Matching"}},{"before":"e08967b179d5a7432f579ea6ea61346664efc728","after":"aa01318b1fa6a72b9b0115048dbba3b1dad35812","ref":"refs/heads/main","pushedAt":"2024-02-25T14:29: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":"3049. Earliest Second to Mark Indices II","shortMessageHtmlLink":"3049. Earliest Second to Mark Indices II"}},{"before":"3430618fcb00fba3c842f31b663357fd5b89b0fa","after":"e08967b179d5a7432f579ea6ea61346664efc728","ref":"refs/heads/main","pushedAt":"2024-02-25T14:28: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":"3048. Earliest Second to Mark Indices I","shortMessageHtmlLink":"3048. Earliest Second to Mark Indices I"}},{"before":"1d31f95935803dc6a344564d56431583157343c5","after":"3430618fcb00fba3c842f31b663357fd5b89b0fa","ref":"refs/heads/main","pushedAt":"2024-02-25T14:28:23.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":"3047. Find the Largest Area of Square Inside Two Rectangles","shortMessageHtmlLink":"3047. Find the Largest Area of Square Inside Two Rectangles"}},{"before":"dfe6574ccbb46667b852a3576e2ea22d316fdda4","after":"1d31f95935803dc6a344564d56431583157343c5","ref":"refs/heads/main","pushedAt":"2024-02-25T14:27:52.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":"3046. Split the Array","shortMessageHtmlLink":"3046. Split the Array"}},{"before":"de5aff097c03db71714935ea02b7353a045dee89","after":"dfe6574ccbb46667b852a3576e2ea22d316fdda4","ref":"refs/heads/main","pushedAt":"2024-02-25T13:54: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":"1000. Minimum Cost to Merge Stones","shortMessageHtmlLink":"1000. Minimum Cost to Merge Stones"}},{"before":"b0174d6ff915d961669513c07c4d2c8fef75f4d0","after":"de5aff097c03db71714935ea02b7353a045dee89","ref":"refs/heads/main","pushedAt":"2024-02-25T13:51:33.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":"1494. Parallel Courses II","shortMessageHtmlLink":"1494. Parallel Courses II"}},{"before":"41d0449288b24139c4c7348c674d5923dbead4d1","after":"b0174d6ff915d961669513c07c4d2c8fef75f4d0","ref":"refs/heads/main","pushedAt":"2024-02-25T13:41: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":"1998. GCD Sort of an Array","shortMessageHtmlLink":"1998. GCD Sort of an Array"}},{"before":"a1fa6a3ba929e7957658d269a7fa9453bce89798","after":"41d0449288b24139c4c7348c674d5923dbead4d1","ref":"refs/heads/main","pushedAt":"2024-02-25T13:38:15.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":"2478. Number of Beautiful Partitions","shortMessageHtmlLink":"2478. Number of Beautiful Partitions"}},{"before":"e5b5713e4ae4b12031b644e1e90712fc93e4dfec","after":"a1fa6a3ba929e7957658d269a7fa9453bce89798","ref":"refs/heads/main","pushedAt":"2024-02-25T13:30:35.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":"2508. Add Edges to Make Degrees of All Nodes Even","shortMessageHtmlLink":"2508. Add Edges to Make Degrees of All Nodes Even"}},{"before":"181e45f68b74f9caf357901cee34bf3107ee5e4a","after":"e5b5713e4ae4b12031b644e1e90712fc93e4dfec","ref":"refs/heads/main","pushedAt":"2024-02-25T13:28: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":"2509. Cycle Length Queries in a Tree","shortMessageHtmlLink":"2509. Cycle Length Queries in a Tree"}},{"before":"12754e6892845c059febaa1ec7f6bdc8e2ba1cb4","after":"181e45f68b74f9caf357901cee34bf3107ee5e4a","ref":"refs/heads/main","pushedAt":"2024-02-25T13:25:25.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":"2518. Number of Great Partitions","shortMessageHtmlLink":"2518. Number of Great Partitions"}},{"before":"32b849bf4d53908016660136aeecfdd0f4662c87","after":"12754e6892845c059febaa1ec7f6bdc8e2ba1cb4","ref":"refs/heads/main","pushedAt":"2024-02-25T13:23:33.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":"2528. Maximize the Minimum Powered City","shortMessageHtmlLink":"2528. Maximize the Minimum Powered City"}},{"before":"c1935133a87aa95c17dae9f4dca10ad7cc90f201","after":"32b849bf4d53908016660136aeecfdd0f4662c87","ref":"refs/heads/main","pushedAt":"2024-02-25T13:19:57.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":"2538. Difference Between Maximum and Minimum Price Sum","shortMessageHtmlLink":"2538. Difference Between Maximum and Minimum Price Sum"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEUZqtWgA","startCursor":null,"endCursor":null}},"title":"Activity · sergeyleschev/leetcode-typescript"}