{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":707171739,"defaultBranch":"main","name":"AlgorithmNEnglishQuests","ownerLogin":"sfyr111","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-10-19T11:13:00.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/18510448?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1697714019.0","currentOid":""},"activityList":{"items":[{"before":"fc7f487c838195c3c0b64bf2f4f60f14a3a68e17","after":"519f89f656d6d096c834e8bdf764864ca43ccae1","ref":"refs/heads/main","pushedAt":"2024-03-05T13:47:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"55. Jump Game","shortMessageHtmlLink":"55. Jump Game"}},{"before":"6247541f86b29b86d28771387dc68d8e6ec980d7","after":"fc7f487c838195c3c0b64bf2f4f60f14a3a68e17","ref":"refs/heads/main","pushedAt":"2024-02-29T15:17:32.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"Merge branch 'main' of https://github.com/sfyr111/AlgorithmNEnglishQuests","shortMessageHtmlLink":"Merge branch 'main' of <a href=\"https://github.com/sfyr111/AlgorithmNEnglishQuests\">https://github.com/sfyr111/AlgorithmNEnglishQu…</a>"}},{"before":"1f6687634417b269c3fc44235677c3db2badb24a","after":"6247541f86b29b86d28771387dc68d8e6ec980d7","ref":"refs/heads/main","pushedAt":"2024-02-25T18:06:45.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"Merge branch 'main' of https://github.com/sfyr111/AlgorithmNEnglishQuests into main","shortMessageHtmlLink":"Merge branch 'main' of <a href=\"https://github.com/sfyr111/AlgorithmNEnglishQuests\">https://github.com/sfyr111/AlgorithmNEnglishQu…</a>"}},{"before":"d2ef7fec5882334a8a3dc03506fcdbb92f36fcfc","after":"1f6687634417b269c3fc44235677c3db2badb24a","ref":"refs/heads/main","pushedAt":"2024-02-23T10:55:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"152. Maximum Product Subarray","shortMessageHtmlLink":"152. Maximum Product Subarray"}},{"before":"c6256db3e4287f4c139d60661fee0e4747f9742d","after":"d2ef7fec5882334a8a3dc03506fcdbb92f36fcfc","ref":"refs/heads/main","pushedAt":"2024-02-19T12:15:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"fix content 139. Word Break","shortMessageHtmlLink":"fix content 139. Word Break"}},{"before":"eefe496258fb09de07f9513ca13662868e4c924a","after":"c6256db3e4287f4c139d60661fee0e4747f9742d","ref":"refs/heads/main","pushedAt":"2024-02-19T11:33:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"139. Word Break","shortMessageHtmlLink":"139. Word Break"}},{"before":"a251d58dc509f058c3f060187cb96730f2a3700b","after":"eefe496258fb09de07f9513ca13662868e4c924a","ref":"refs/heads/main","pushedAt":"2024-02-18T11:44:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"91. Decode Ways","shortMessageHtmlLink":"91. Decode Ways"}},{"before":"b457d4e9b977ddd984ca1b3ea679b1500a3c6da5","after":"a251d58dc509f058c3f060187cb96730f2a3700b","ref":"refs/heads/main","pushedAt":"2024-02-07T12:16:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"647. Palindromic Substrings","shortMessageHtmlLink":"647. Palindromic Substrings"}},{"before":"ac4f4d27029d092704883f097a326951307a9ca2","after":"b457d4e9b977ddd984ca1b3ea679b1500a3c6da5","ref":"refs/heads/main","pushedAt":"2024-02-05T13:07:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"5. Longest Palindromic Substring","shortMessageHtmlLink":"5. Longest Palindromic Substring"}},{"before":"d0d3a08632d03798105d7202ce681451b0c39067","after":"ac4f4d27029d092704883f097a326951307a9ca2","ref":"refs/heads/main","pushedAt":"2024-02-04T12:03:29.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"add coin-change.png","shortMessageHtmlLink":"add coin-change.png"}},{"before":"b8119954151545740360dbe378889162d0ee48b8","after":"d0d3a08632d03798105d7202ce681451b0c39067","ref":"refs/heads/main","pushedAt":"2024-02-04T11:55:09.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"300. Longest Increasing Subsequence","shortMessageHtmlLink":"300. Longest Increasing Subsequence"}},{"before":"9b1de18b161c1a16c87d12da51d9e0c61989df1b","after":"b8119954151545740360dbe378889162d0ee48b8","ref":"refs/heads/main","pushedAt":"2024-02-02T14:01:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"322. Coin Change","shortMessageHtmlLink":"322. Coin Change"}},{"before":"17daf4ddbaa8597e6d032362ff9d806e2f944679","after":"9b1de18b161c1a16c87d12da51d9e0c61989df1b","ref":"refs/heads/main","pushedAt":"2024-01-30T12:57:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"213. House Robber II","shortMessageHtmlLink":"213. House Robber II"}},{"before":"de44a357b7e10587c2896f5f2d6290405103e20c","after":"17daf4ddbaa8597e6d032362ff9d806e2f944679","ref":"refs/heads/main","pushedAt":"2024-01-29T13:43:08.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"198. House Robber","shortMessageHtmlLink":"198. House Robber"}},{"before":"99234efbb26667b06a4676f8f57eb00f36cc3b68","after":"de44a357b7e10587c2896f5f2d6290405103e20c","ref":"refs/heads/main","pushedAt":"2024-01-28T14:52:18.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"70. Climbing Stairs","shortMessageHtmlLink":"70. Climbing Stairs"}},{"before":"a8d4623785b32f7e96b3541f0e5d1aeb019c4db5","after":"99234efbb26667b06a4676f8f57eb00f36cc3b68","ref":"refs/heads/main","pushedAt":"2024-01-24T13:41:27.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"108. Convert Sorted Array to Binary Search Tree","shortMessageHtmlLink":"108. Convert Sorted Array to Binary Search Tree"}},{"before":"fefe71da5fa6fcb3fff5d0e942b6e92005d13912","after":"a8d4623785b32f7e96b3541f0e5d1aeb019c4db5","ref":"refs/heads/main","pushedAt":"2024-01-23T13:53:55.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"112. Path Sum","shortMessageHtmlLink":"112. Path Sum"}},{"before":"5c94a5b8b85d51f3502e2b88096d21d0fa3a1d61","after":"fefe71da5fa6fcb3fff5d0e942b6e92005d13912","ref":"refs/heads/main","pushedAt":"2024-01-21T12:59:46.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"145. Binary Tree Postorder Traversal","shortMessageHtmlLink":"145. Binary Tree Postorder Traversal"}},{"before":"35c368aea680ff2b3fe3baebfb6235a84cf90672","after":"5c94a5b8b85d51f3502e2b88096d21d0fa3a1d61","ref":"refs/heads/main","pushedAt":"2024-01-18T11:40:32.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"297. Serialize and Deserialize Binary Tree","shortMessageHtmlLink":"297. Serialize and Deserialize Binary Tree"}},{"before":"fe515e4ef5a1a367eb6924fbf8b1d1e688fec08c","after":"35c368aea680ff2b3fe3baebfb6235a84cf90672","ref":"refs/heads/main","pushedAt":"2024-01-15T12:28:15.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"Merge branch 'main' of https://github.com/sfyr111/AlgorithmNEnglishQuests","shortMessageHtmlLink":"Merge branch 'main' of <a href=\"https://github.com/sfyr111/AlgorithmNEnglishQuests\">https://github.com/sfyr111/AlgorithmNEnglishQu…</a>"}},{"before":"8a85a7525a98c42ae2a55b3f06af555b221169f7","after":"fe515e4ef5a1a367eb6924fbf8b1d1e688fec08c","ref":"refs/heads/main","pushedAt":"2024-01-14T12:10:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"230. Kth Smallest Element in a BST","shortMessageHtmlLink":"230. Kth Smallest Element in a BST"}},{"before":"4287049623bbcd4b32258b99fe844394c53da686","after":"8a85a7525a98c42ae2a55b3f06af555b221169f7","ref":"refs/heads/main","pushedAt":"2024-01-11T11:38:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"98. Validate Binary Search Tree","shortMessageHtmlLink":"98. Validate Binary Search Tree"}},{"before":"9ec5dad9f5a18b2dd192815eca69c6b1f524c99f","after":"4287049623bbcd4b32258b99fe844394c53da686","ref":"refs/heads/main","pushedAt":"2024-01-10T04:38:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"1448. Count Good Nodes in Binary Tree","shortMessageHtmlLink":"1448. Count Good Nodes in Binary Tree"}},{"before":"f6bceb893ee2f22ae8e6b29828f5da974c1cd760","after":"9ec5dad9f5a18b2dd192815eca69c6b1f524c99f","ref":"refs/heads/main","pushedAt":"2024-01-09T12:43:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"199. Binary Tree Right Side View","shortMessageHtmlLink":"199. Binary Tree Right Side View"}},{"before":"553c2d0cd9d9b308f1f888079bf69a70b5fa13b3","after":"f6bceb893ee2f22ae8e6b29828f5da974c1cd760","ref":"refs/heads/main","pushedAt":"2024-01-05T12:03:56.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"102. Binary Tree Level Order Traversal","shortMessageHtmlLink":"102. Binary Tree Level Order Traversal"}},{"before":"abb14f20eaf1def1be4902e54f5b196929576997","after":"553c2d0cd9d9b308f1f888079bf69a70b5fa13b3","ref":"refs/heads/main","pushedAt":"2024-01-04T12:06:29.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"235. Lowest Common Ancestor of a Binary Search Tree","shortMessageHtmlLink":"235. Lowest Common Ancestor of a Binary Search Tree"}},{"before":"6c604dcd632b628e887e19c58aa362b4cb7fb1ab","after":"abb14f20eaf1def1be4902e54f5b196929576997","ref":"refs/heads/main","pushedAt":"2024-01-03T11:19:05.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"572. Subtree of Another Tree","shortMessageHtmlLink":"572. Subtree of Another Tree"}},{"before":"6f33e1c6d2b5e8a01a5eae44efbd058b624e7c3e","after":"6c604dcd632b628e887e19c58aa362b4cb7fb1ab","ref":"refs/heads/main","pushedAt":"2023-12-29T12:11:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"110. Balanced Binary Tree","shortMessageHtmlLink":"110. Balanced Binary Tree"}},{"before":"b3ede9d8b4e85768dc5aba863d3b955968fe500a","after":"6f33e1c6d2b5e8a01a5eae44efbd058b624e7c3e","ref":"refs/heads/main","pushedAt":"2023-12-28T11:31:08.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"543. Diameter of Binary Tree","shortMessageHtmlLink":"543. Diameter of Binary Tree"}},{"before":"183cd87ca70f2ebd778da6f56ff0a05d988719dd","after":"b3ede9d8b4e85768dc5aba863d3b955968fe500a","ref":"refs/heads/main","pushedAt":"2023-12-27T13:50:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"sfyr111","name":"Ryan","path":"/sfyr111","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18510448?s=80&v=4"},"commit":{"message":"104. Maximum Depth of Binary Tree","shortMessageHtmlLink":"104. Maximum Depth of Binary Tree"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEDOSJ6gA","startCursor":null,"endCursor":null}},"title":"Activity · sfyr111/AlgorithmNEnglishQuests"}