{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":774351402,"defaultBranch":"main","name":"LeetCode","ownerLogin":"ZakariaMQ","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2024-03-19T11:57:00.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/122093341?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1710849420.0","currentOid":""},"activityList":{"items":[{"before":"ee9f5929221e0be7de145e8e72ae2505339d3715","after":"a60a7f4d41850d3afb36e206e7c319f002cc3464","ref":"refs/heads/main","pushedAt":"2024-05-31T09:32:03.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":"Solved \"Problem No. 445. Add Two Numbers II\"","shortMessageHtmlLink":"Solved \"Problem No. 445. Add Two Numbers II\""}},{"before":"243976c839a1377e5f402711391d059050887f60","after":"ee9f5929221e0be7de145e8e72ae2505339d3715","ref":"refs/heads/main","pushedAt":"2024-05-31T08:55:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":".","shortMessageHtmlLink":"."}},{"before":"375b942026163228fffb69b52806dec6debdcf13","after":"243976c839a1377e5f402711391d059050887f60","ref":"refs/heads/main","pushedAt":"2024-05-31T08:22:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":"Solved \"Problem No. 700. Search in a Binary Search Tree\"","shortMessageHtmlLink":"Solved \"Problem No. 700. Search in a Binary Search Tree\""}},{"before":"a3ba5a7755f59846a2477fd6d047690ef7a6aa36","after":"375b942026163228fffb69b52806dec6debdcf13","ref":"refs/heads/main","pushedAt":"2024-05-31T08:13:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":".","shortMessageHtmlLink":"."}},{"before":"d31feb63eb55bbeb0b22dbb03210a887edbd8b4a","after":"a3ba5a7755f59846a2477fd6d047690ef7a6aa36","ref":"refs/heads/main","pushedAt":"2024-05-31T07:54:32.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":"Solved \"Problem No. 1372. Longest ZigZag Path in a Binary Tree\"","shortMessageHtmlLink":"Solved \"Problem No. 1372. Longest ZigZag Path in a Binary Tree\""}},{"before":"fea6e5a6bb1cd3c33f18ce456ac776dd78424e4c","after":"d31feb63eb55bbeb0b22dbb03210a887edbd8b4a","ref":"refs/heads/main","pushedAt":"2024-05-31T06:53:33.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":".","shortMessageHtmlLink":"."}},{"before":"7e52fcbeffe96860bbe31532beda71eb83c4e0ba","after":"fea6e5a6bb1cd3c33f18ce456ac776dd78424e4c","ref":"refs/heads/main","pushedAt":"2024-05-30T11:47:05.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":"Solved \"Problem No. 19. Remove Nth Node From End of List\"","shortMessageHtmlLink":"Solved \"Problem No. 19. Remove Nth Node From End of List\""}},{"before":"adeca68eeb026f97b90ce9d5ced673ff82fe3350","after":"7e52fcbeffe96860bbe31532beda71eb83c4e0ba","ref":"refs/heads/main","pushedAt":"2024-05-30T09:57:28.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":".","shortMessageHtmlLink":"."}},{"before":"9ba3508ef662e74d4280d8eacc56d7a76eb2d2ed","after":"adeca68eeb026f97b90ce9d5ced673ff82fe3350","ref":"refs/heads/main","pushedAt":"2024-05-29T10:03:03.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":"solved \"Problem No. 8. String to Integer (atoi)\"","shortMessageHtmlLink":"solved \"Problem No. 8. String to Integer (atoi)\""}},{"before":"a63a07d1209aadff4319f1d96215add7d58d8b11","after":"9ba3508ef662e74d4280d8eacc56d7a76eb2d2ed","ref":"refs/heads/main","pushedAt":"2024-05-29T10:02:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":".","shortMessageHtmlLink":"."}},{"before":"813a1597f5ef9695512d95adc14f43a2ada0b404","after":"a63a07d1209aadff4319f1d96215add7d58d8b11","ref":"refs/heads/main","pushedAt":"2024-05-29T07:54:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":"Solved \"roblem No. 7. Reverse Integer\"","shortMessageHtmlLink":"Solved \"roblem No. 7. Reverse Integer\""}},{"before":"bdb6a7b46eb9c81d7bedfb702dda5bd806e04566","after":"813a1597f5ef9695512d95adc14f43a2ada0b404","ref":"refs/heads/main","pushedAt":"2024-05-29T07:54:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":".","shortMessageHtmlLink":"."}},{"before":"6b7c9b3631cd59875143b902cf316033b65c2bf4","after":"bdb6a7b46eb9c81d7bedfb702dda5bd806e04566","ref":"refs/heads/main","pushedAt":"2024-05-28T08:59:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":"Solved \"Problem No. 437. Path Sum III\"","shortMessageHtmlLink":"Solved \"Problem No. 437. Path Sum III\""}},{"before":"5cd7240a41c67b0cc9206ffe909ac73de3c22b94","after":"6b7c9b3631cd59875143b902cf316033b65c2bf4","ref":"refs/heads/main","pushedAt":"2024-05-28T08:27:43.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":".","shortMessageHtmlLink":"."}},{"before":"a2e3f7f29623e6ea64e15396cfbbf07da9032750","after":"5cd7240a41c67b0cc9206ffe909ac73de3c22b94","ref":"refs/heads/main","pushedAt":"2024-05-27T19:31:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":"Solved \"Problem No. 5. Longest Palindromic Substring\"","shortMessageHtmlLink":"Solved \"Problem No. 5. Longest Palindromic Substring\""}},{"before":"30df0c4fafd78153fdd23d7b2f76deb556e80b15","after":"a2e3f7f29623e6ea64e15396cfbbf07da9032750","ref":"refs/heads/main","pushedAt":"2024-05-27T19:11:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":".","shortMessageHtmlLink":"."}},{"before":"c9d54a3dbbfc05b4dd27f6e069e30243698dda09","after":"30df0c4fafd78153fdd23d7b2f76deb556e80b15","ref":"refs/heads/main","pushedAt":"2024-05-27T18:52:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":"Solved \"Problem No. 24. Swap Nodes in Pairs\"","shortMessageHtmlLink":"Solved \"Problem No. 24. Swap Nodes in Pairs\""}},{"before":"59bcdd4d7894d9490995269faced0ecdf49e406d","after":"c9d54a3dbbfc05b4dd27f6e069e30243698dda09","ref":"refs/heads/main","pushedAt":"2024-05-27T18:35:03.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":".","shortMessageHtmlLink":"."}},{"before":"596fe4fa8aa391d7de8e3767cf927dd52c8623f1","after":"59bcdd4d7894d9490995269faced0ecdf49e406d","ref":"refs/heads/main","pushedAt":"2024-05-27T08:48:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":"Solved \"Problem No. 1448. Count Good Nodes in Binary Tree\"","shortMessageHtmlLink":"Solved \"Problem No. 1448. Count Good Nodes in Binary Tree\""}},{"before":"0a0756fd4ec9c204a6968c69e5fa7338d5c81cba","after":"596fe4fa8aa391d7de8e3767cf927dd52c8623f1","ref":"refs/heads/main","pushedAt":"2024-05-27T08:01:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":".","shortMessageHtmlLink":"."}},{"before":"678cdcaedc5465be780fd278012dfd25970e3fc8","after":"0a0756fd4ec9c204a6968c69e5fa7338d5c81cba","ref":"refs/heads/main","pushedAt":"2024-05-27T07:30:13.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":"Solved \"Problem No. 219. Contains Duplicate II\"","shortMessageHtmlLink":"Solved \"Problem No. 219. Contains Duplicate II\""}},{"before":"fd9e27687d7690c25923ce2c4cbdbdb48964f33f","after":"678cdcaedc5465be780fd278012dfd25970e3fc8","ref":"refs/heads/main","pushedAt":"2024-05-27T07:08:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":".","shortMessageHtmlLink":"."}},{"before":"6aad95cf3d5ef3034afaa1cbb37c373f7c5c0e7b","after":"fd9e27687d7690c25923ce2c4cbdbdb48964f33f","ref":"refs/heads/main","pushedAt":"2024-05-27T06:28:27.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":"Solved \"Problem No. 543. Diameter of Binary Tree\"","shortMessageHtmlLink":"Solved \"Problem No. 543. Diameter of Binary Tree\""}},{"before":"b423d6a09c2ca46cde181bc4bd06b5d6dd6c5fc4","after":"6aad95cf3d5ef3034afaa1cbb37c373f7c5c0e7b","ref":"refs/heads/main","pushedAt":"2024-05-27T05:35:28.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":".","shortMessageHtmlLink":"."}},{"before":"b83501f0451da4156be1bf89334da1925ba3b627","after":"b423d6a09c2ca46cde181bc4bd06b5d6dd6c5fc4","ref":"refs/heads/main","pushedAt":"2024-05-26T09:35:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":"Solved \"Problem No. 101. Symmetric Tree\"","shortMessageHtmlLink":"Solved \"Problem No. 101. Symmetric Tree\""}},{"before":"8feca9dc1b14db8321cf7bea963f03377b286233","after":"b83501f0451da4156be1bf89334da1925ba3b627","ref":"refs/heads/main","pushedAt":"2024-05-26T08:55:54.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":".","shortMessageHtmlLink":"."}},{"before":"827fbf74e6c944c9ca6cc907d15d8d93b99eb90d","after":"8feca9dc1b14db8321cf7bea963f03377b286233","ref":"refs/heads/main","pushedAt":"2024-05-26T08:03:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":"solved \"Problem No. 226. Invert Binary Tree\"","shortMessageHtmlLink":"solved \"Problem No. 226. Invert Binary Tree\""}},{"before":"406a208039772bcff016328bbb964ca0c78bbbf9","after":"827fbf74e6c944c9ca6cc907d15d8d93b99eb90d","ref":"refs/heads/main","pushedAt":"2024-05-26T07:11:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":".","shortMessageHtmlLink":"."}},{"before":"12bc602586e4c191ae6c26dca33a1ce9955e01b7","after":"406a208039772bcff016328bbb964ca0c78bbbf9","ref":"refs/heads/main","pushedAt":"2024-05-26T07:07:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":"Solved \"Problem No. 94. Binary Tree Inorder Traversal\"","shortMessageHtmlLink":"Solved \"Problem No. 94. Binary Tree Inorder Traversal\""}},{"before":"f30637e668413154a6848565d37bae86b564d8d5","after":"12bc602586e4c191ae6c26dca33a1ce9955e01b7","ref":"refs/heads/main","pushedAt":"2024-05-26T06:37:54.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ZakariaMQ","name":"SeasonedCode","path":"/ZakariaMQ","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/122093341?s=80&v=4"},"commit":{"message":".","shortMessageHtmlLink":"."}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"startCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wNS0zMVQwOTozMjowMy4wMDAwMDBazwAAAARY2j67","endCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wNS0yNlQwNjozNzo1NC4wMDAwMDBazwAAAARUBZ8l"}},"title":"Activity · ZakariaMQ/LeetCode"}