{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":88291206,"defaultBranch":"master","name":"LeetcodeSolutionWithMultipleLanguages","ownerLogin":"jiajionline","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2017-04-14T18:07:49.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/27472290?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1573311439.0","currentOid":""},"activityList":{"items":[{"before":"2f333208b741862e6f78c1a5056c3c56de03d866","after":"dbaae224f144223b373a0c2caf23c0b88fded075","ref":"refs/heads/master","pushedAt":"2024-05-22T13:41:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Update 0576 Out of Boundary Paths","shortMessageHtmlLink":"Update 0576 Out of Boundary Paths"}},{"before":"c690613662ca72086b93650d84ec2f2cc22eff21","after":"2f333208b741862e6f78c1a5056c3c56de03d866","ref":"refs/heads/master","pushedAt":"2024-04-23T13:41:29.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Update 310 Minimum Height Trees","shortMessageHtmlLink":"Update 310 Minimum Height Trees"}},{"before":"704764aa8d368abaf6dc7d224d4a8a2f678b03dd","after":"c690613662ca72086b93650d84ec2f2cc22eff21","ref":"refs/heads/master","pushedAt":"2024-04-09T16:13:58.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 2073 Time Needed to Buy  Tickets","shortMessageHtmlLink":"Leetcode 2073 Time Needed to Buy Tickets"}},{"before":"be54b03fc3fa03d3313da06afa349009505d318e","after":"704764aa8d368abaf6dc7d224d4a8a2f678b03dd","ref":"refs/heads/master","pushedAt":"2024-04-08T15:43:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 1700 Number of Students Unable to Eat Lunch","shortMessageHtmlLink":"Leetcode 1700 Number of Students Unable to Eat Lunch"}},{"before":"758e061d88ca0b865a67f849d18cfea1f6d47adf","after":"be54b03fc3fa03d3313da06afa349009505d318e","ref":"refs/heads/master","pushedAt":"2023-12-04T15:26:25.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 542 Matrix","shortMessageHtmlLink":"Leetcode 542 Matrix"}},{"before":"afa76d4cb7e13e320cc28424d7b81b6642455048","after":"758e061d88ca0b865a67f849d18cfea1f6d47adf","ref":"refs/heads/master","pushedAt":"2023-11-14T15:05:54.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 312 Burst Balloons","shortMessageHtmlLink":"Leetcode 312 Burst Balloons"}},{"before":"7b45baf18215d0c94e2e2eab0ab2f722637be54d","after":"afa76d4cb7e13e320cc28424d7b81b6642455048","ref":"refs/heads/master","pushedAt":"2023-11-10T15:06:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 498 Diagonal Traverse","shortMessageHtmlLink":"Leetcode 498 Diagonal Traverse"}},{"before":"cb8b064302b3bb7dd453de79030ac2b418bac71e","after":"7b45baf18215d0c94e2e2eab0ab2f722637be54d","ref":"refs/heads/master","pushedAt":"2023-11-10T14:53:15.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 156 Binary Tree Upside Down","shortMessageHtmlLink":"Leetcode 156 Binary Tree Upside Down"}},{"before":"c8941c31e49a335a38c9c3f2f69f21908e8a449c","after":"cb8b064302b3bb7dd453de79030ac2b418bac71e","ref":"refs/heads/master","pushedAt":"2023-10-01T16:46:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 1074 Number of Submatrices That Sum to Target","shortMessageHtmlLink":"Leetcode 1074 Number of Submatrices That Sum to Target"}},{"before":"9f8a90f1b9dd1d8949e37c3101fda3127ceae150","after":"c8941c31e49a335a38c9c3f2f69f21908e8a449c","ref":"refs/heads/master","pushedAt":"2023-09-29T13:16:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 117 Populating Next Right Pointers in Each Node II","shortMessageHtmlLink":"Leetcode 117 Populating Next Right Pointers in Each Node II"}},{"before":"184c152b5af0e9345a508824e698c95d8a285b07","after":"9f8a90f1b9dd1d8949e37c3101fda3127ceae150","ref":"refs/heads/master","pushedAt":"2023-09-28T13:22:26.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 113 Path Sum II","shortMessageHtmlLink":"Leetcode 113 Path Sum II"}},{"before":"1d195d8cec197b56d281cb7edfb6cc7b68073627","after":"184c152b5af0e9345a508824e698c95d8a285b07","ref":"refs/heads/master","pushedAt":"2023-09-27T13:10:07.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 931 Minimum Falling Path Sum","shortMessageHtmlLink":"Leetcode 931 Minimum Falling Path Sum"}},{"before":"0b6b4e8ac7658a0ee5caedaf4e623c2a1654361f","after":"1d195d8cec197b56d281cb7edfb6cc7b68073627","ref":"refs/heads/master","pushedAt":"2023-09-24T23:16:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 445 Add Two Numbers II","shortMessageHtmlLink":"Leetcode 445 Add Two Numbers II"}},{"before":"bb37ed9138c33a01e86d1942bd66d3cf51d59c79","after":"0b6b4e8ac7658a0ee5caedaf4e623c2a1654361f","ref":"refs/heads/master","pushedAt":"2023-09-24T20:10:33.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 211 Design Add and Search Words Data Structure","shortMessageHtmlLink":"Leetcode 211 Design Add and Search Words Data Structure"}},{"before":"17b20b2cc68c417e59ea12a7f17cec9c0c9bd515","after":"bb37ed9138c33a01e86d1942bd66d3cf51d59c79","ref":"refs/heads/master","pushedAt":"2023-09-24T14:07:31.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"update setting","shortMessageHtmlLink":"update setting"}},{"before":"66837abb337ad61c3fca0be5c198623b0febd80d","after":"17b20b2cc68c417e59ea12a7f17cec9c0c9bd515","ref":"refs/heads/master","pushedAt":"2023-09-23T14:02:22.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 1768 Merge Strings Alternately","shortMessageHtmlLink":"Leetcode 1768 Merge Strings Alternately"}},{"before":"b074c579647bef653d901cffbdf00df5d10e27d0","after":"66837abb337ad61c3fca0be5c198623b0febd80d","ref":"refs/heads/master","pushedAt":"2023-09-21T03:12:36.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 1971 Find if Path Exists in Graph","shortMessageHtmlLink":"Leetcode 1971 Find if Path Exists in Graph"}},{"before":"62f2010a305238c899e5664c86c9cda59743746a","after":"b074c579647bef653d901cffbdf00df5d10e27d0","ref":"refs/heads/master","pushedAt":"2023-09-20T04:31:33.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 986 Interval List Intersections","shortMessageHtmlLink":"Leetcode 986 Interval List Intersections"}},{"before":"3f7289de9461421c9d7cf76e775033e6dc5944f9","after":"62f2010a305238c899e5664c86c9cda59743746a","ref":"refs/heads/master","pushedAt":"2023-09-19T13:13:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 841 Keys and Rooms","shortMessageHtmlLink":"Leetcode 841 Keys and Rooms"}},{"before":"bc88ad2f5de00dc115ca81a98580691b5f90f57e","after":"3f7289de9461421c9d7cf76e775033e6dc5944f9","ref":"refs/heads/master","pushedAt":"2023-09-16T13:40:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 865 Smallest Subtree with all the Deepest Nodes","shortMessageHtmlLink":"Leetcode 865 Smallest Subtree with all the Deepest Nodes"}},{"before":"e11c362c354707637063a16786e0ef68f18e0615","after":"bc88ad2f5de00dc115ca81a98580691b5f90f57e","ref":"refs/heads/master","pushedAt":"2023-09-14T13:33:00.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetocde 270 Closest Binary Search Tree Value","shortMessageHtmlLink":"Leetocde 270 Closest Binary Search Tree Value"}},{"before":"850b27f8a3f0d1c305fb9bff3e60b55a7ebbe304","after":"e11c362c354707637063a16786e0ef68f18e0615","ref":"refs/heads/master","pushedAt":"2023-09-13T23:15:06.000Z","pushType":"push","commitsCount":4,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 926 Flip String to Monotone Increasing","shortMessageHtmlLink":"Leetcode 926 Flip String to Monotone Increasing"}},{"before":"e83d47586c10ac190f8e0f64c034f30dcaf7b26c","after":"850b27f8a3f0d1c305fb9bff3e60b55a7ebbe304","ref":"refs/heads/master","pushedAt":"2023-09-12T12:19:16.000Z","pushType":"push","commitsCount":5,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 1304 Find N Unique Integers Sum up to Zero","shortMessageHtmlLink":"Leetcode 1304 Find N Unique Integers Sum up to Zero"}},{"before":"de7068eb43f1e2f05d284e42b23fb4d9d294ea2d","after":"e83d47586c10ac190f8e0f64c034f30dcaf7b26c","ref":"refs/heads/master","pushedAt":"2023-09-10T13:56:35.000Z","pushType":"push","commitsCount":5,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 771 Jewels and Stones","shortMessageHtmlLink":"Leetcode 771 Jewels and Stones"}},{"before":"6037024949c9e2ea72aec1ce8d6935de0b8ddffc","after":"de7068eb43f1e2f05d284e42b23fb4d9d294ea2d","ref":"refs/heads/master","pushedAt":"2023-09-09T21:54:15.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 1351 Count Negative Numbers in a Sorted Matrix","shortMessageHtmlLink":"Leetcode 1351 Count Negative Numbers in a Sorted Matrix"}},{"before":"d2e511d52491a7c0b7b7132f0872aa0ac815ac97","after":"6037024949c9e2ea72aec1ce8d6935de0b8ddffc","ref":"refs/heads/master","pushedAt":"2023-09-08T23:00:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 257 Binary Tree Paths","shortMessageHtmlLink":"Leetcode 257 Binary Tree Paths"}},{"before":"48f17ed33b2947634c17cd87c79aa11911ac0769","after":"d2e511d52491a7c0b7b7132f0872aa0ac815ac97","ref":"refs/heads/master","pushedAt":"2023-09-08T16:27:23.000Z","pushType":"push","commitsCount":5,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 695 Max Area of Island","shortMessageHtmlLink":"Leetcode 695 Max Area of Island"}},{"before":"1de0344eabaa9eddc5c1ebba63eecf0bace691c8","after":"48f17ed33b2947634c17cd87c79aa11911ac0769","ref":"refs/heads/master","pushedAt":"2023-09-07T04:20:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 875 Koko Eating Bananas","shortMessageHtmlLink":"Leetcode 875 Koko Eating Bananas"}},{"before":"3a188ba82749e1f05b46789a59e77126e0a4db77","after":"1de0344eabaa9eddc5c1ebba63eecf0bace691c8","ref":"refs/heads/master","pushedAt":"2023-09-06T16:31:51.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 763 Partition Labels","shortMessageHtmlLink":"Leetcode 763 Partition Labels"}},{"before":"d7dd1ba8621db51ac12d67cdcdf74f6831c748d2","after":"3a188ba82749e1f05b46789a59e77126e0a4db77","ref":"refs/heads/master","pushedAt":"2023-09-04T14:45:13.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"jiajionline","name":"Jiajionline","path":"/jiajionline","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/27472290?s=80&v=4"},"commit":{"message":"Leetcode 1569 Number of Ways to Reorder Array to Get Same BST","shortMessageHtmlLink":"Leetcode 1569 Number of Ways to Reorder Array to Get Same BST"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEUPzyYAA","startCursor":null,"endCursor":null}},"title":"Activity · jiajionline/LeetcodeSolutionWithMultipleLanguages"}