{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":477777541,"defaultBranch":"master","name":"Problem-Solving","ownerLogin":"ChocoBreeze","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2022-04-04T16:11:55.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/75352656?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1649167051.060482","currentOid":""},"activityList":{"items":[{"before":"ceb7c547d48545c86cb3d0605bf07075ef364209","after":"0027212d322bbf88bbbe0c83744a3851cc33136b","ref":"refs/heads/master","pushedAt":"2024-09-18T11:09:15.000Z","pushType":"push","commitsCount":4,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.09.18 - 179. Largest Number","shortMessageHtmlLink":"Leet Code 24.09.18 - 179. Largest Number"}},{"before":"20f8cc89798b39ce3709747576a8cf8720d5a08c","after":"ceb7c547d48545c86cb3d0605bf07075ef364209","ref":"refs/heads/master","pushedAt":"2024-09-15T16:23:09.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.09.14 - 2419. Longest Subarray With Maximum Bitwise AND","shortMessageHtmlLink":"Leet Code 24.09.14 - 2419. Longest Subarray With Maximum Bitwise AND"}},{"before":"ca8b70447a5fd5f81f1b946af7c405abd8980adf","after":"20f8cc89798b39ce3709747576a8cf8720d5a08c","ref":"refs/heads/master","pushedAt":"2024-09-12T14:13:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.09.12 - 1684. Count the Number of Consistent Strings","shortMessageHtmlLink":"Leet Code 24.09.12 - 1684. Count the Number of Consistent Strings"}},{"before":"4ba15e1cb205b98a7475f5b515b2531805746deb","after":"ca8b70447a5fd5f81f1b946af7c405abd8980adf","ref":"refs/heads/master","pushedAt":"2024-09-11T15:13:21.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.09.11 - 2220. Minimum Bit Flips to Convert Number","shortMessageHtmlLink":"Leet Code 24.09.11 - 2220. Minimum Bit Flips to Convert Number"}},{"before":"62edc5f5a54b389e388ad25765606e5d9906b610","after":"4ba15e1cb205b98a7475f5b515b2531805746deb","ref":"refs/heads/master","pushedAt":"2024-09-09T15:04:02.000Z","pushType":"push","commitsCount":4,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.09.09 - 2326. Spiral Matrix IV","shortMessageHtmlLink":"Leet Code 24.09.09 - 2326. Spiral Matrix IV"}},{"before":"725f31ae16480d21378ae9874ba72a33437fd74e","after":"62edc5f5a54b389e388ad25765606e5d9906b610","ref":"refs/heads/master","pushedAt":"2024-09-08T15:08:02.000Z","pushType":"push","commitsCount":5,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"24.08.24 - 564. Find the Closest Palindrome - Solution Update","shortMessageHtmlLink":"24.08.24 - 564. Find the Closest Palindrome - Solution Update"}},{"before":"ccddd195109e2a1a8b713e3892ddf6e64a02b5a7","after":"725f31ae16480d21378ae9874ba72a33437fd74e","ref":"refs/heads/master","pushedAt":"2024-09-05T15:10:58.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.09.05 - 2028. Find Missing Observations","shortMessageHtmlLink":"Leet Code 24.09.05 - 2028. Find Missing Observations"}},{"before":"2394074ed4d71d604e83032885e27727cde99e62","after":"ccddd195109e2a1a8b713e3892ddf6e64a02b5a7","ref":"refs/heads/master","pushedAt":"2024-09-04T15:25:00.000Z","pushType":"push","commitsCount":6,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.09.04 - 874. Walking Robot Simulation","shortMessageHtmlLink":"Leet Code 24.09.04 - 874. Walking Robot Simulation"}},{"before":"507990bae535f063362c2f40e575db02a9791eff","after":"2394074ed4d71d604e83032885e27727cde99e62","ref":"refs/heads/master","pushedAt":"2024-09-02T15:30:07.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"24.08.29 - 947. Most Stones Removed with Same Row or Column","shortMessageHtmlLink":"24.08.29 - 947. Most Stones Removed with Same Row or Column"}},{"before":"009019d17c7b3bbc354f4b461a4ce9c325f29fc5","after":"507990bae535f063362c2f40e575db02a9791eff","ref":"refs/heads/master","pushedAt":"2024-08-27T14:35:15.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.27 - 1514. Path with Maximum Probability","shortMessageHtmlLink":"Leet Code 24.08.27 - 1514. Path with Maximum Probability"}},{"before":"951a7c1b8abfd9ff8ad4cc72bf278f13db3335bd","after":"009019d17c7b3bbc354f4b461a4ce9c325f29fc5","ref":"refs/heads/master","pushedAt":"2024-08-23T13:42:31.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.23 - 592. Fraction Addition and Subtraction","shortMessageHtmlLink":"Leet Code 24.08.23 - 592. Fraction Addition and Subtraction"}},{"before":"f53e476e65301bd6a84d83e0d8565910e0954797","after":"951a7c1b8abfd9ff8ad4cc72bf278f13db3335bd","ref":"refs/heads/master","pushedAt":"2024-08-20T14:34:30.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.20 - 1140. Stone Game II","shortMessageHtmlLink":"Leet Code 24.08.20 - 1140. Stone Game II"}},{"before":"ea382d886b457ef7b6986c686c774b6f738db13c","after":"f53e476e65301bd6a84d83e0d8565910e0954797","ref":"refs/heads/master","pushedAt":"2024-08-19T14:06:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.19 - 650. 2 Keys Keyboard","shortMessageHtmlLink":"Leet Code 24.08.19 - 650. 2 Keys Keyboard"}},{"before":"1cb9a8bb511aee7f44ace64da523202d0fde0dce","after":"ea382d886b457ef7b6986c686c774b6f738db13c","ref":"refs/heads/master","pushedAt":"2024-08-18T15:31:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.18 - 264. Ugly Number II","shortMessageHtmlLink":"Leet Code 24.08.18 - 264. Ugly Number II"}},{"before":"1d31b08fc5374d3d458a22362d6c6accd848d9eb","after":"1cb9a8bb511aee7f44ace64da523202d0fde0dce","ref":"refs/heads/master","pushedAt":"2024-08-17T12:55:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.17 - 1937. Maximum Number of Points with Cost","shortMessageHtmlLink":"Leet Code 24.08.17 - 1937. Maximum Number of Points with Cost"}},{"before":"eb5387eba315dd06f34cc9052803b347db373ebd","after":"1d31b08fc5374d3d458a22362d6c6accd848d9eb","ref":"refs/heads/master","pushedAt":"2024-08-16T08:43:38.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.16 - 624. Maximum Distance in Arrays","shortMessageHtmlLink":"Leet Code 24.08.16 - 624. Maximum Distance in Arrays"}},{"before":"2d8870efac2be1fd765bf0ff6586b275054cb50a","after":"eb5387eba315dd06f34cc9052803b347db373ebd","ref":"refs/heads/master","pushedAt":"2024-08-13T13:35:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.13 - 40. Combination Sum II","shortMessageHtmlLink":"Leet Code 24.08.13 - 40. Combination Sum II"}},{"before":"dd6bbc1169c3a2c44053efb7ff4d121bb4f18e46","after":"2d8870efac2be1fd765bf0ff6586b275054cb50a","ref":"refs/heads/master","pushedAt":"2024-08-12T13:54:00.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.12 - 703. Kth Largest Element in a Stream","shortMessageHtmlLink":"Leet Code 24.08.12 - 703. Kth Largest Element in a Stream"}},{"before":"8bd480fc7346c9990d3ab3e8be61911fe6dcbb25","after":"dd6bbc1169c3a2c44053efb7ff4d121bb4f18e46","ref":"refs/heads/master","pushedAt":"2024-08-11T15:08:37.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.11 - 1568. Minimum Number of Days to Disconnect Island","shortMessageHtmlLink":"Leet Code 24.08.11 - 1568. Minimum Number of Days to Disconnect Island"}},{"before":"cdeb40db3e6ba996f2147af13f4abfce4eca2b90","after":"8bd480fc7346c9990d3ab3e8be61911fe6dcbb25","ref":"refs/heads/master","pushedAt":"2024-08-08T13:53:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.08 - 885. Spiral Matrix III","shortMessageHtmlLink":"Leet Code 24.08.08 - 885. Spiral Matrix III"}},{"before":"332fbd7f3db6072a11fa4e7d3c46f4f12c4bc9ff","after":"cdeb40db3e6ba996f2147af13f4abfce4eca2b90","ref":"refs/heads/master","pushedAt":"2024-08-07T14:19:25.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.07 - 273. Integer to English Words","shortMessageHtmlLink":"Leet Code 24.08.07 - 273. Integer to English Words"}},{"before":"1a1c379d9c3d0b530e12117be12c63bd3c5f1ecd","after":"332fbd7f3db6072a11fa4e7d3c46f4f12c4bc9ff","ref":"refs/heads/master","pushedAt":"2024-08-06T14:11:47.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.06 - 3016. Minimum Number of Pushes to Type Word II","shortMessageHtmlLink":"Leet Code 24.08.06 - 3016. Minimum Number of Pushes to Type Word II"}},{"before":"ae16b8bc4b282841528c173ca1d904139eefd2f6","after":"1a1c379d9c3d0b530e12117be12c63bd3c5f1ecd","ref":"refs/heads/master","pushedAt":"2024-08-05T14:41:28.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.05 - 2053. Kth Distinct String in an Array","shortMessageHtmlLink":"Leet Code 24.08.05 - 2053. Kth Distinct String in an Array"}},{"before":"942c5eea3a3dff16887ce5572005dcffbafa1561","after":"ae16b8bc4b282841528c173ca1d904139eefd2f6","ref":"refs/heads/master","pushedAt":"2024-08-04T14:37:47.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.04 - 1508. Range Sum of Sorted Subarray Sums","shortMessageHtmlLink":"Leet Code 24.08.04 - 1508. Range Sum of Sorted Subarray Sums"}},{"before":"f241304382e8d195bbea569662a6b4fff6098360","after":"942c5eea3a3dff16887ce5572005dcffbafa1561","ref":"refs/heads/master","pushedAt":"2024-08-03T11:08:41.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.03 - 1460. Make Two Arrays Equal by Reversing Subarrays","shortMessageHtmlLink":"Leet Code 24.08.03 - 1460. Make Two Arrays Equal by Reversing Subarrays"}},{"before":"aec05ed913cf4d06765842143954c774e02782ef","after":"f241304382e8d195bbea569662a6b4fff6098360","ref":"refs/heads/master","pushedAt":"2024-08-01T14:20:10.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.08.01 - 2678. Number of Senior Citizens","shortMessageHtmlLink":"Leet Code 24.08.01 - 2678. Number of Senior Citizens"}},{"before":"f130c8c01dccf0d383774c50954a4a8a7daabb14","after":"aec05ed913cf4d06765842143954c774e02782ef","ref":"refs/heads/master","pushedAt":"2024-07-31T14:12:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.07.31 - 1105. Filling Bookcase Shelves","shortMessageHtmlLink":"Leet Code 24.07.31 - 1105. Filling Bookcase Shelves"}},{"before":"e52226eb41c63302662f1291917407a9738c0374","after":"f130c8c01dccf0d383774c50954a4a8a7daabb14","ref":"refs/heads/master","pushedAt":"2024-07-30T14:21:32.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Merge branch 'master' of https://github.com/ChocoBreeze/Problem-Solving","shortMessageHtmlLink":"Merge branch 'master' of <a href=\"https://github.com/ChocoBreeze/Problem-Solving\">https://github.com/ChocoBreeze/Problem-Solving</a>"}},{"before":"19cde5dea79961bb4a88a48ea8083f7443cd069c","after":"e52226eb41c63302662f1291917407a9738c0374","ref":"refs/heads/master","pushedAt":"2024-07-27T17:02:24.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.07.27 - 2976. Minimum Cost to Convert String I","shortMessageHtmlLink":"Leet Code 24.07.27 - 2976. Minimum Cost to Convert String I"}},{"before":"fe7ab8426433eaf59ac8bcc2e7946557e830e12d","after":"19cde5dea79961bb4a88a48ea8083f7443cd069c","ref":"refs/heads/master","pushedAt":"2024-07-25T14:36:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ChocoBreeze","name":"정영훈","path":"/ChocoBreeze","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/75352656?s=80&v=4"},"commit":{"message":"Leet Code 24.07.25 - 912. Sort an Array","shortMessageHtmlLink":"Leet Code 24.07.25 - 912. Sort an Array"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"Y3Vyc29yOnYyOpK7MjAyNC0wOS0xOFQxMTowOToxNS4wMDAwMDBazwAAAAS5k4-V","startCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wOS0xOFQxMTowOToxNS4wMDAwMDBazwAAAAS5k4-V","endCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wNy0yNVQxNDozNjozNy4wMDAwMDBazwAAAASJH8td"}},"title":"Activity · ChocoBreeze/Problem-Solving"}