{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":584894424,"defaultBranch":"main","name":"LeetCode","ownerLogin":"Djokovic0311","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-01-03T19:43:58.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/55948986?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1672775038.506905","currentOid":""},"activityList":{"items":[{"before":"739c9ce1b3c5690b89c70ff040a1f63439fd47da","after":"97ae95743b5652a77e414a219edf7890d160a14c","ref":"refs/heads/main","pushedAt":"2024-03-05T00:34:49.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Bag of Tokens (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Bag of Tokens (cpp)"}},{"before":"dff0c3398c65c37820533fe7be3925c186766c63","after":"739c9ce1b3c5690b89c70ff040a1f63439fd47da","ref":"refs/heads/main","pushedAt":"2024-03-04T00:35:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Remove Nth Node From End of List (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Remove Nth Node From End of List (cpp)"}},{"before":"c05877e2cf3d76ab92596e128859e461ed22083a","after":"dff0c3398c65c37820533fe7be3925c186766c63","ref":"refs/heads/main","pushedAt":"2024-03-03T00:37:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Squares of a Sorted Array (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Squares of a Sorted Array (cpp)"}},{"before":"a480c988c9c4bddafd71486e08c600dc22f583e8","after":"c05877e2cf3d76ab92596e128859e461ed22083a","ref":"refs/heads/main","pushedAt":"2024-03-02T00:34:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Maximum Odd Binary Number (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Maximum Odd Binary Number (cpp)"}},{"before":"d6735a5fac1929db09f4abc1011a663f9d7e761f","after":"a480c988c9c4bddafd71486e08c600dc22f583e8","ref":"refs/heads/main","pushedAt":"2024-02-29T05:42:44.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Even Odd Tree (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Even Odd Tree (cpp)"}},{"before":"74047ce7a0c506f200724eca04559d47f18e96d8","after":"d6735a5fac1929db09f4abc1011a663f9d7e761f","ref":"refs/heads/main","pushedAt":"2024-02-29T05:42:43.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Find Bottom Left Tree Value (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Find Bottom Left Tree Value (cpp)"}},{"before":"8861de168807b038181a388c86a54914b4bd1857","after":"74047ce7a0c506f200724eca04559d47f18e96d8","ref":"refs/heads/main","pushedAt":"2024-02-29T05:42:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Diameter of Binary Tree (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Diameter of Binary Tree (cpp)"}},{"before":"a0743874c0e311dd3b181a591ef621dde18601bb","after":"8861de168807b038181a388c86a54914b4bd1857","ref":"refs/heads/main","pushedAt":"2024-02-29T05:42:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Same Tree (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Same Tree (cpp)"}},{"before":"809b09d6d6063c110a4803e846d24ed63e1866d3","after":"a0743874c0e311dd3b181a591ef621dde18601bb","ref":"refs/heads/main","pushedAt":"2024-02-29T05:42:41.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Greatest Common Divisor Traversal (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Greatest Common Divisor Traversal (cpp)"}},{"before":"23032ecc2e96625ec8ba8a8a0dbafcafacc23945","after":"809b09d6d6063c110a4803e846d24ed63e1866d3","ref":"refs/heads/main","pushedAt":"2024-02-24T00:33:00.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Find All People With Secret (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Find All People With Secret (cpp)"}},{"before":"3e72c77e93b50d8b351f9498bcd64f67c20851f6","after":"23032ecc2e96625ec8ba8a8a0dbafcafacc23945","ref":"refs/heads/main","pushedAt":"2024-02-24T00:33:00.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Cheapest Flights Within K Stops (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Cheapest Flights Within K Stops (cpp)"}},{"before":"35cda821333657c83eda1961704c3723dd119c0d","after":"3e72c77e93b50d8b351f9498bcd64f67c20851f6","ref":"refs/heads/main","pushedAt":"2024-02-23T00:34:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Find the Town Judge (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Find the Town Judge (cpp)"}},{"before":"128f6e5e531b8238c242fbb4c214e42029429f82","after":"35cda821333657c83eda1961704c3723dd119c0d","ref":"refs/heads/main","pushedAt":"2024-02-22T00:34:54.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Bitwise AND of Numbers Range (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Bitwise AND of Numbers Range (cpp)"}},{"before":"3ff22f9cf74b6e2b533dbfb97896cc49e8ebd977","after":"128f6e5e531b8238c242fbb4c214e42029429f82","ref":"refs/heads/main","pushedAt":"2024-02-20T00:55:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Missing Number (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Missing Number (cpp)"}},{"before":"53cfdaf4dbb58449f1a04b4a22c2aa3427dd60a9","after":"3ff22f9cf74b6e2b533dbfb97896cc49e8ebd977","ref":"refs/heads/main","pushedAt":"2024-02-20T00:34:30.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Power of Two (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Power of Two (cpp)"}},{"before":"49dfb6838e31f02376b47cec38a8f885a941bd6e","after":"53cfdaf4dbb58449f1a04b4a22c2aa3427dd60a9","ref":"refs/heads/main","pushedAt":"2024-02-19T00:36:13.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Find the Length of the Longest Common Prefix (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Find the Length of the Longest Common Pref…"}},{"before":"8a617aa6a26b6ab47ea2872b93d9baf87d590daf","after":"49dfb6838e31f02376b47cec38a8f885a941bd6e","ref":"refs/heads/main","pushedAt":"2024-02-19T00:36:13.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Most Frequent Prime (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Most Frequent Prime (cpp)"}},{"before":"e15a01ea37ae2d5460fdedd8f661b0876499098d","after":"8a617aa6a26b6ab47ea2872b93d9baf87d590daf","ref":"refs/heads/main","pushedAt":"2024-02-19T00:36:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Count Prefix and Suffix Pairs I (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Count Prefix and Suffix Pairs I (cpp)"}},{"before":"1d7cb4053cf9f62d08c823532d22278bb27d4111","after":"e15a01ea37ae2d5460fdedd8f661b0876499098d","ref":"refs/heads/main","pushedAt":"2024-02-18T00:37:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Meeting Rooms III (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Meeting Rooms III (cpp)"}},{"before":"4ca6b439b516411d91c1bbf0f99b34c67c5862f2","after":"1d7cb4053cf9f62d08c823532d22278bb27d4111","ref":"refs/heads/main","pushedAt":"2024-02-18T00:37:47.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Furthest Building You Can Reach (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Furthest Building You Can Reach (cpp)"}},{"before":"26729c895b0c15bbb8b0ca30e9154377e32e302a","after":"4ca6b439b516411d91c1bbf0f99b34c67c5862f2","ref":"refs/heads/main","pushedAt":"2024-02-17T00:34:40.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Least Number of Unique Integers after K Removals (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Least Number of Unique Integers after K Re…"}},{"before":"161c4a9e784258c4a528bd2199aa3a1b1e3c1d62","after":"26729c895b0c15bbb8b0ca30e9154377e32e302a","ref":"refs/heads/main","pushedAt":"2024-02-16T00:34:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Find Polygon With the Largest Perimeter (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Find Polygon With the Largest Perimeter (cpp)"}},{"before":"461e7abfea6b3a79b988dc3e03d806675280ae6e","after":"161c4a9e784258c4a528bd2199aa3a1b1e3c1d62","ref":"refs/heads/main","pushedAt":"2024-02-15T00:35:10.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Rearrange Array Elements by Sign (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Rearrange Array Elements by Sign (cpp)"}},{"before":"f6c5c65bcb7b47c39a4d70dcdddbf1025c0b3713","after":"461e7abfea6b3a79b988dc3e03d806675280ae6e","ref":"refs/heads/main","pushedAt":"2024-02-13T00:35:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Find First Palindromic String in the Array (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Find First Palindromic String in the Array…"}},{"before":"f199bab18e7f6dab4bad8aedc46ee2f151dd38ba","after":"f6c5c65bcb7b47c39a4d70dcdddbf1025c0b3713","ref":"refs/heads/main","pushedAt":"2024-02-13T00:35:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Majority Element (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Majority Element (cpp)"}},{"before":"33e8f3fb337b917295628fabc37a212c58ba54aa","after":"f199bab18e7f6dab4bad8aedc46ee2f151dd38ba","ref":"refs/heads/main","pushedAt":"2024-02-11T18:25:20.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Cherry Pickup II (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Cherry Pickup II (cpp)"}},{"before":"602159052a941f5fdf351d7b814f19cca008ffd6","after":"33e8f3fb337b917295628fabc37a212c58ba54aa","ref":"refs/heads/main","pushedAt":"2024-02-11T18:25:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Palindromic Substrings (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Palindromic Substrings (cpp)"}},{"before":"95e242593996353489c5f2fa49569298f018a088","after":"602159052a941f5fdf351d7b814f19cca008ffd6","ref":"refs/heads/main","pushedAt":"2024-02-11T18:25:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Largest Divisible Subset (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Largest Divisible Subset (cpp)"}},{"before":"6d4792cb279a73ee25bb95096dcb70d6774ed07c","after":"95e242593996353489c5f2fa49569298f018a088","ref":"refs/heads/main","pushedAt":"2024-02-11T18:25:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Perfect Squares (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Perfect Squares (cpp)"}},{"before":"7f470332e9442aae619ccfc9d8f074d191bdcfb3","after":"6d4792cb279a73ee25bb95096dcb70d6774ed07c","ref":"refs/heads/main","pushedAt":"2024-02-11T18:25:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Sync LeetCode submission - Sum of Matrix After Queries (cpp)","shortMessageHtmlLink":"Sync LeetCode submission - Sum of Matrix After Queries (cpp)"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEDE-wCAA","startCursor":null,"endCursor":null}},"title":"Activity · Djokovic0311/LeetCode"}