{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":686711079,"defaultBranch":"master","name":"LeetCode","ownerLogin":"squxq","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-09-03T17:40:20.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/118564179?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1693813643.0","currentOid":""},"activityList":{"items":[{"before":"fbeadfb59259bb726e5a3749728bde697ff96c56","after":"3df3a2292a7a2c4d50b13e850eb3f067c96a98e4","ref":"refs/heads/master","pushedAt":"2024-01-26T20:40:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  576 . Out of Boundary Paths","shortMessageHtmlLink":"problem: new problem solution - 576 . Out of Boundary Paths"}},{"before":"0571a91dd9eda53035812d68930b25416d447e96","after":"fbeadfb59259bb726e5a3749728bde697ff96c56","ref":"refs/heads/master","pushedAt":"2024-01-25T18:22:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution - 1143 . Longest Common Subsequence","shortMessageHtmlLink":"problem: new problem solution - 1143 . Longest Common Subsequence"}},{"before":"8dc395d0a07fc1e2bdff77dc60c1517531a3f956","after":"0571a91dd9eda53035812d68930b25416d447e96","ref":"refs/heads/master","pushedAt":"2024-01-24T21:09:09.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution - 1457 . Pseudo-Palindromic Paths in a Binary Tree","shortMessageHtmlLink":"problem: new problem solution - 1457 . Pseudo-Palindromic Paths in a …"}},{"before":"a74e6b40ce3927becdb9e1b3b47465738b790b79","after":"8dc395d0a07fc1e2bdff77dc60c1517531a3f956","ref":"refs/heads/master","pushedAt":"2024-01-23T20:51:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  1239 . Maximum Length of Concatenated String with Unique Characters","shortMessageHtmlLink":"problem: new problem solution - 1239 . Maximum Length of Concatenated…"}},{"before":"955c8a05fb3f4ac6e010a5fd3b3ec004948e0147","after":"a74e6b40ce3927becdb9e1b3b47465738b790b79","ref":"refs/heads/master","pushedAt":"2024-01-22T20:46:33.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  645 . Set Mismatch","shortMessageHtmlLink":"problem: new problem solution - 645 . Set Mismatch"}},{"before":"ed64169e1492bab5a43e496314c6a93ddec018dc","after":"955c8a05fb3f4ac6e010a5fd3b3ec004948e0147","ref":"refs/heads/master","pushedAt":"2024-01-21T16:58:02.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  198 . House Robber","shortMessageHtmlLink":"problem: new problem solution - 198 . House Robber"}},{"before":"5ff26b1d8bbb9250c4723f623dc1e9964129dd84","after":"ed64169e1492bab5a43e496314c6a93ddec018dc","ref":"refs/heads/master","pushedAt":"2024-01-19T21:56:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  931 . Minimum Falling Path Sum","shortMessageHtmlLink":"problem: new problem solution - 931 . Minimum Falling Path Sum"}},{"before":"cd657485489db601f20f65a4059992f770d77204","after":"5ff26b1d8bbb9250c4723f623dc1e9964129dd84","ref":"refs/heads/master","pushedAt":"2024-01-18T21:18:09.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  70 . Climbing Stairs","shortMessageHtmlLink":"problem: new problem solution - 70 . Climbing Stairs"}},{"before":"d3e7ffddfdae38f1801803f69055bf883b1f233f","after":"cd657485489db601f20f65a4059992f770d77204","ref":"refs/heads/master","pushedAt":"2024-01-17T15:12:26.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  1207 . Unique Number of Occurrences","shortMessageHtmlLink":"problem: new problem solution - 1207 . Unique Number of Occurrences"}},{"before":"efd0f42628da4e0ee9fb95b419abc5f34366d94e","after":"d3e7ffddfdae38f1801803f69055bf883b1f233f","ref":"refs/heads/master","pushedAt":"2024-01-16T21:38:35.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  380 . Insert Delete GetRandom O(1)","shortMessageHtmlLink":"problem: new problem solution - 380 . Insert Delete GetRandom O(1)"}},{"before":"f2834f026400b5efd8a5bc935138b8dc59556c43","after":"efd0f42628da4e0ee9fb95b419abc5f34366d94e","ref":"refs/heads/master","pushedAt":"2024-01-15T21:39:20.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  2225 . Find Players With Zero or One Losses","shortMessageHtmlLink":"problem: new problem solution - 2225 . Find Players With Zero or One …"}},{"before":"58f0b07574691370d1221cb5dc905aaf8542e755","after":"f2834f026400b5efd8a5bc935138b8dc59556c43","ref":"refs/heads/master","pushedAt":"2024-01-14T21:01:48.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  1657 . Determine if Two Strings Are Close","shortMessageHtmlLink":"problem: new problem solution - 1657 . Determine if Two Strings Are C…"}},{"before":"bbe628fa9fc3198966cc4a022d7bcbfac30f4114","after":"58f0b07574691370d1221cb5dc905aaf8542e755","ref":"refs/heads/master","pushedAt":"2024-01-13T15:43:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  1347 . Minimum Number of Steps to Make Two Strings Anagram","shortMessageHtmlLink":"problem: new problem solution - 1347 . Minimum Number of Steps to Mak…"}},{"before":"24c835c8239dda47884e476b8b2750487e63c45a","after":"bbe628fa9fc3198966cc4a022d7bcbfac30f4114","ref":"refs/heads/master","pushedAt":"2024-01-12T22:48:34.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  334 . Increasing Triplet Subsequence","shortMessageHtmlLink":"problem: new problem solution - 334 . Increasing Triplet Subsequence"}},{"before":"685639b6adc49fe629c2a33b0ad46da32df61b63","after":"24c835c8239dda47884e476b8b2750487e63c45a","ref":"refs/heads/master","pushedAt":"2024-01-11T18:13:13.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  1026 . Maximum Difference Between Node and Ancestor","shortMessageHtmlLink":"problem: new problem solution - 1026 . Maximum Difference Between Nod…"}},{"before":"c462c4606e7959e9a60b184f81dd0765a68df057","after":"685639b6adc49fe629c2a33b0ad46da32df61b63","ref":"refs/heads/master","pushedAt":"2024-01-10T17:54:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  2385 . Amount of Time for Binary Tree to Be Infected","shortMessageHtmlLink":"problem: new problem solution - 2385 . Amount of Time for Binary Tree…"}},{"before":"f9db26e291a09d613f981255619a2f429bd242f3","after":"c462c4606e7959e9a60b184f81dd0765a68df057","ref":"refs/heads/master","pushedAt":"2024-01-09T21:47:32.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  872 . Leaf-Similar Trees","shortMessageHtmlLink":"problem: new problem solution - 872 . Leaf-Similar Trees"}},{"before":"b3864d24b80d5fc9e64a7d33b9cd0fef17418aeb","after":"f9db26e291a09d613f981255619a2f429bd242f3","ref":"refs/heads/master","pushedAt":"2024-01-08T21:36:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem submit - 938 . Range Sum of BST","shortMessageHtmlLink":"problem: new problem submit - 938 . Range Sum of BST"}},{"before":"3fc039cb359e66342964085e5214df7ad4872a1f","after":"b3864d24b80d5fc9e64a7d33b9cd0fef17418aeb","ref":"refs/heads/master","pushedAt":"2024-01-07T17:18:20.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  238 . Product of Array Except Self","shortMessageHtmlLink":"problem: new problem solution - 238 . Product of Array Except Self"}},{"before":"d147e8aa07da101bfffab94e26328cd4279196a2","after":"3fc039cb359e66342964085e5214df7ad4872a1f","ref":"refs/heads/master","pushedAt":"2024-01-07T09:27:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  446 . Arithmetic Slices II - Subsequence","shortMessageHtmlLink":"problem: new problem solution - 446 . Arithmetic Slices II - Subsequence"}},{"before":"6125a6b4afdf7dc000ac2fb537f25c8b65dda5f2","after":"d147e8aa07da101bfffab94e26328cd4279196a2","ref":"refs/heads/master","pushedAt":"2024-01-06T11:18:25.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  1235 . Maximum Profit in Job Scheduling","shortMessageHtmlLink":"problem: new problem solution - 1235 . Maximum Profit in Job Scheduling"}},{"before":"b705ca9b74af961a47db4c422cd917aa9360e349","after":"6125a6b4afdf7dc000ac2fb537f25c8b65dda5f2","ref":"refs/heads/master","pushedAt":"2024-01-05T22:30:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  300 . Longest Increasing Subsequence","shortMessageHtmlLink":"problem: new problem solution - 300 . Longest Increasing Subsequence"}},{"before":"696f6a66e4f6a7ad8cf94e3b2f75a9a8d8b8a5f6","after":"b705ca9b74af961a47db4c422cd917aa9360e349","ref":"refs/heads/master","pushedAt":"2024-01-04T15:23:54.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  2870 . Minimum Number of Operations to Make Array Empty","shortMessageHtmlLink":"problem: new problem solution - 2870 . Minimum Number of Operations t…"}},{"before":"1bb7bc78de76c7108762f5486cc177a1448248de","after":"696f6a66e4f6a7ad8cf94e3b2f75a9a8d8b8a5f6","ref":"refs/heads/master","pushedAt":"2024-01-03T17:41:58.000Z","pushType":"push","commitsCount":6,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  2125 . Number of Laser Beams in a Bank","shortMessageHtmlLink":"problem: new problem solution - 2125 . Number of Laser Beams in a Bank"}},{"before":"a0b0b77aeeb5089a97289a79870d4abdd1a16818","after":"1bb7bc78de76c7108762f5486cc177a1448248de","ref":"refs/heads/master","pushedAt":"2024-01-02T22:14:22.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  1531 . String Compression II","shortMessageHtmlLink":"problem: new problem solution - 1531 . String Compression II"}},{"before":"8d85aeeb40fd9fde47b534a38d4c449028f1492c","after":"a0b0b77aeeb5089a97289a79870d4abdd1a16818","ref":"refs/heads/master","pushedAt":"2024-01-02T16:11:01.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  1578 . Minimum Time to Make Rope Colorful","shortMessageHtmlLink":"problem: new problem solution - 1578 . Minimum Time to Make Rope Colo…"}},{"before":"61bfe059a975b231fa5a325856c131b944faf994","after":"8d85aeeb40fd9fde47b534a38d4c449028f1492c","ref":"refs/heads/master","pushedAt":"2023-12-24T10:43:44.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  1758 . Minimum Changes To Make Alternating Binary String","shortMessageHtmlLink":"problem: new problem solution - 1758 . Minimum Changes To Make Altern…"}},{"before":"c1d046b5102818d150ab2991a7319ad4cd0c1649","after":"61bfe059a975b231fa5a325856c131b944faf994","ref":"refs/heads/master","pushedAt":"2023-12-23T07:39:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  1496 . Path Crossing","shortMessageHtmlLink":"problem: new problem solution - 1496 . Path Crossing"}},{"before":"a804e9948ab710075c3e827cf1ad07aac0c1992c","after":"c1d046b5102818d150ab2991a7319ad4cd0c1649","ref":"refs/heads/master","pushedAt":"2023-12-22T08:18:33.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  1422 . Maximum Score After Splitting a String","shortMessageHtmlLink":"problem: new problem solution - 1422 . Maximum Score After Splitting …"}},{"before":"685e4030081307be137d686a223d682e740d0da4","after":"a804e9948ab710075c3e827cf1ad07aac0c1992c","ref":"refs/heads/master","pushedAt":"2023-12-21T08:13:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"squxq","name":"Francisco Tomás","path":"/squxq","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/118564179?s=80&v=4"},"commit":{"message":"problem: new problem solution -  1637 . Widest Vertical Area Between Two Points Containing No Points","shortMessageHtmlLink":"problem: new problem solution - 1637 . Widest Vertical Area Between T…"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAD6jdS8AA","startCursor":null,"endCursor":null}},"title":"Activity · squxq/LeetCode"}