{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":413829883,"defaultBranch":"master","name":"Algorithm-Log","ownerLogin":"hyelie","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2021-10-05T13:29:19.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/51824413?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1633440611.086884","currentOid":""},"activityList":{"items":[{"before":"2d80691a16a8290bb2a048e5222f68230430fa96","after":"117eafda465eb117a30a1c1db8cb811f0275e4ae","ref":"refs/heads/master","pushedAt":"2024-03-22T14:32:38.000Z","pushType":"push","commitsCount":7,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"solve: Programmers 추석 트래픽\nLv. 3, 15분","shortMessageHtmlLink":"solve: Programmers 추석 트래픽"}},{"before":"30ce384896c35178f9626f77a6c5bf94504ae541","after":"2d80691a16a8290bb2a048e5222f68230430fa96","ref":"refs/heads/master","pushedAt":"2024-03-21T14:44:11.000Z","pushType":"push","commitsCount":6,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"giveup: Programmers 블록 이동하기\nLv. 3, 42분, unsolved\n구현 알겠는데 복잡...","shortMessageHtmlLink":"giveup: Programmers 블록 이동하기"}},{"before":"02d9df176222ecc908d7a3ee56817514659f0d0a","after":"30ce384896c35178f9626f77a6c5bf94504ae541","ref":"refs/heads/master","pushedAt":"2024-03-19T14:50:24.000Z","pushType":"push","commitsCount":12,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"solve: Programmers 파괴되지 않은 건물\nLv. 3, 15분\n2차원 psum","shortMessageHtmlLink":"solve: Programmers 파괴되지 않은 건물"}},{"before":"ca0e0a4eac4133e207482e42c9652b1e773811eb","after":"02d9df176222ecc908d7a3ee56817514659f0d0a","ref":"refs/heads/master","pushedAt":"2024-03-10T16:10:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"solve: Programmers 이모티콘 할인행사\nLv. 2, 45분\n단순한 backtrack 구현 문제인데, 조건에 헷갈려서 실수를 많이 했다.\nemoticon_sales[j] >= users[i][0]으로 해야 했는데 >를 하기도 해서 문제 발생. 그리고 index를 i로 쓸지 j로 쓸지도 헷갈림.\n옛날에 푼 것 보니까 그게 훨씬 더 깔끔했다.","shortMessageHtmlLink":"solve: Programmers 이모티콘 할인행사"}},{"before":"b41fcd8dab333cbe0f4fc4283a8d9d52b8b387db","after":"ca0e0a4eac4133e207482e42c9652b1e773811eb","ref":"refs/heads/master","pushedAt":"2024-03-10T14:47:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"solve: Programmers N-Queen\nLv. 2, 7분\n그냥 backtrack 기본 문제","shortMessageHtmlLink":"solve: Programmers N-Queen"}},{"before":"7a018dd61cc2b02f951057b34b069b83c24f7451","after":"b41fcd8dab333cbe0f4fc4283a8d9d52b8b387db","ref":"refs/heads/master","pushedAt":"2024-03-10T14:30:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"solve: Programmers 숫자 블록\nLv. 2, 30분\nint, long long 형변환 때문에 시간 초과가 그렇게 날 수 있나,,","shortMessageHtmlLink":"solve: Programmers 숫자 블록"}},{"before":"b1edd266ee68ca95daa01c79305feb119009b3cc","after":"7a018dd61cc2b02f951057b34b069b83c24f7451","ref":"refs/heads/master","pushedAt":"2024-03-10T14:00:57.000Z","pushType":"push","commitsCount":8,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"solve: Programmers 양궁대회\nLv. 3, 35분\nbrute-force로 하면, 10개의 동일한 화살을 11개의 구역에 나눠 배치하는 방법이므로 11H10, 20C10이므로 10*10, 시간 초과가 난다.\n따라서 생각을 바꿔야 한다.\n\n어피치보다 잘 쏴서 점수를 얻는 경우 / 어피치가 쏜 곳에 안 쏘는 경우 이렇게 2가지 경우로 나눌 수 있다.\n후자는 항상 가능한 경우의 수고,\n전자는 \"현재 남은 화살의 수\"가 \"어피치가 쏜 화살 개수 + 1\"보다 많아야 한다.\n그러면, 각 depth에서 분기는 2개, 총 2^10으로 시간 내에 풀 수 있다.\n\n유의해야 하는 점은 문제가 길기 때문에 세부 항목을 잘 구현해야 하는 것.\n - 특히, \"어피치가 이기는 경우\"에는 갱신하면 안 된다.","shortMessageHtmlLink":"solve: Programmers 양궁대회"}},{"before":"0e995f5fc4b62ec4747de12cbd6eab220a7f1d6c","after":"b1edd266ee68ca95daa01c79305feb119009b3cc","ref":"refs/heads/master","pushedAt":"2024-03-09T15:00:07.000Z","pushType":"push","commitsCount":11,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"solve: Programmers 순위 검색\nLv. 3, 50분\n빢빢빢구현 문제.\n\n입력이 5만, 각 조건의 경우의 수는 3, 2, 2, 2이다.\n정렬 등으로는 해결할 수 없는 게, DB로 치면 3*2*2*2개의 경우의 수에 index를 걸어야 한다.\n    - 입력이 \"-\"로 들어와 모든 경우를 탐색한다고 생각하면 4*3*3*3개이다!\n그래서 정렬로 풀면 안되고, 모든 경우의 수에 대해 insert를 해야 한다.\n\n처음에는 multiset으로 접근했는데, multiset은 iterator 간의 - 연산이 안 되어서(당연한 말이다.) vector로 바꾸었다.\n그리고, 4가지 조건에 대해 index를 받고, 이를 하나의 숫자 index로 바꿔주는 연산을 하나 만들었다.\n    - 그러면 1번째 조건에 대해 4개의 조건(3가지 + 전체), 2번째 조건에 대해 3개의 조건(2가지 + 전체), ... 이렇게 둘 수 있다.\n그러면 각 조건의 index를 받아 db_index로 변환하고, query의 경우에는 db[db_index]에서 조회하면 된다. 조회 부분 끝.\n\ninsert 부분은 지원자의 4가지 조건에 대해\n[1번째 조건, 2번째 조건, 3번째 조건, 4번째 조건]\n[1번째 조건, 2번째 조건, 3번째 조건, 전체]\n...\n이렇게 2^4의 경우의 수 각각에 대해서\n    - 4가지 조건에 대한 index를 받고 하나의 숫자 index로 바꿔주는 연산을 통해 db[db_index].push_back(score)를 하면 되었다.\n\n신경써야 할 부분은 db_index로 변환하는 부분, parse()에서 모든 경우의 수에 대해 insert해주는 부분이다.\n\n시간복잡도는 여유로운 게, n = 50000에 대해 2*2*2*2 = 16개의 vector에 넣는다. 총 4*4*4*4 = 256개의 vector * length 50000 정도이고\nvector 하나당 int = 4byte, 200000byte = 200kb, 256개면 51200kb = 5mb이므로 메모리 제한도 생각보다 여유롭다.\n전체 정렬은 256 * 50000 * log(50000)이므로 20만*log(50000)이므로 여유롭다.\n조회할 때는 접근해서 lower bound 때리므로 100000 * log(50000)이므로 여유롭다.","shortMessageHtmlLink":"solve: Programmers 순위 검색"}},{"before":"6b0f0966a026642bbe404649a27d48674951180e","after":"0e995f5fc4b62ec4747de12cbd6eab220a7f1d6c","ref":"refs/heads/master","pushedAt":"2024-03-07T15:20:08.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"solve Programmers 인사고과\nLv. 3, 30분\n답 보고 풀었음. 예전에 풀었을 때도 답 보고 풀었던 것 같다. 문제 자체에는 트릭이 있다.\n\n.first 내림차순, .second 오름차순으로 정렬한다.\n이후 앞에서부터 순회하면서 저장한 .second 값과 비교한다.\n만약 저장한 .second 값보다 순회한 .second 값이 더 크다면, OK. save.\n + 추가로 .second를 갱신해야 한다. 6, 6 - 4, 8 - 3, 7의 경우를 생각하면 된다.\n그렇지 않다면, .first는 무조건 더 작고, (정렬 때문) .second도 더 작으므로 거른다.\n\n이후, 등수에서도 하나의 트릭을 쓴다.\n합 기준 내림차 정렬하고, \"나\"가 동순위 중 1등이라 생각한다.\n그러면 앞에 몇 명이 동순위든 상관없고, 내가 동순위라도 상관없어진다. 제일 먼저 찾아진 i가 답.","shortMessageHtmlLink":"solve Programmers 인사고과"}},{"before":"e10d3f48e2134616aa7859d0348b42cedf7779a3","after":"6b0f0966a026642bbe404649a27d48674951180e","ref":"refs/heads/master","pushedAt":"2024-03-06T14:30:25.000Z","pushType":"push","commitsCount":4,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"solve: Programmers 요격 시스템\n\nLv. 3, 12분\n(개구간)이기 때문에 끝 점을 포함하면 안 된다. 사실상 Lv. 3의 단속카메라 문제와 같은 문제.\n끝 점 오름차순 정렬 후 그게 포착하지 못하는 게 있다면 그 target의 끝점으로 잡으면 된다.\n개구간이기 때문에 0.1을 빼던가, >=로 하면 된다.","shortMessageHtmlLink":"solve: Programmers 요격 시스템"}},{"before":"e2e48a027b9e2a601c2b8247e4247a48fa3ba1c1","after":"e10d3f48e2134616aa7859d0348b42cedf7779a3","ref":"refs/heads/master","pushedAt":"2024-03-05T14:34:50.000Z","pushType":"push","commitsCount":7,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"solve: Programmers 경주로 건설\nLv. 3, 50분\nbacktrack으로 시작했는데, graph 문제 + 최단거리이기 때문에 dijkstra를 생각해야 했다.\n그러나, pq를 사용하면 능사가 아닌 게, 300(최소값)에서 500을 더해 리턴했는데, 400에서 100을 더해 최소값이 500이 될 수도 있다.\n따라서 탐색을 끝까지 모두 진행해야 한다. 이게 첫 번째.\n\n다음으로는 모듈화만 잘 되면 된다. 벽 부수고 이동하기처럼, [현재 상태]를 저장해야 한다.\n여기서는 [이전에 어떤 방향으로 진행했는지]가 그 정보이다. 이 정보를 사용해야만 꺾는지 안꺾는지를 알 수 있기 때문.\n\n이 두개면 유념하면 bfs로 쉽게 풀 수 있다.","shortMessageHtmlLink":"solve: Programmers 경주로 건설"}},{"before":"989e25bf8ea3a195e05702c9052023e0cea85fad","after":"e2e48a027b9e2a601c2b8247e4247a48fa3ba1c1","ref":"refs/heads/master","pushedAt":"2024-03-04T13:20:03.000Z","pushType":"push","commitsCount":39,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"Merge branch 'master' of github.com:hyelie/Algorithm-Log","shortMessageHtmlLink":"Merge branch 'master' of github.com:hyelie/Algorithm-Log"}},{"before":"ec7b2e6bb2c0c49a18a3bb58fc2a171edaa004b7","after":"989e25bf8ea3a195e05702c9052023e0cea85fad","ref":"refs/heads/master","pushedAt":"2024-02-24T06:30:49.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"etc: Append CRunner files to git ignore","shortMessageHtmlLink":"etc: Append CRunner files to git ignore"}},{"before":"feb162d13de11ab5b5aab1fa1b23e04b3310ae55","after":"ec7b2e6bb2c0c49a18a3bb58fc2a171edaa004b7","ref":"refs/heads/master","pushedAt":"2024-02-24T06:29:20.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"feat: Append file I/O template","shortMessageHtmlLink":"feat: Append file I/O template"}},{"before":"b0d7091ac8550045a75fb418ebdff58183eb4ad1","after":"feb162d13de11ab5b5aab1fa1b23e04b3310ae55","ref":"refs/heads/master","pushedAt":"2023-10-08T04:15:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"cleanup: Rename merged folder name","shortMessageHtmlLink":"cleanup: Rename merged folder name"}},{"before":"450bc5b55760f950b065829488756055410bd64b","after":"b0d7091ac8550045a75fb418ebdff58183eb4ad1","ref":"refs/heads/master","pushedAt":"2023-10-08T04:12:35.000Z","pushType":"push","commitsCount":86,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"merge: Merge with daily-algorithm-study","shortMessageHtmlLink":"merge: Merge with daily-algorithm-study"}},{"before":"14c0b67ce9c1aa467887cd000c3cb77e70f084a7","after":"450bc5b55760f950b065829488756055410bd64b","ref":"refs/heads/master","pushedAt":"2023-07-29T07:22:43.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"Fixed file name","shortMessageHtmlLink":"Fixed file name"}},{"before":"9122cba6c7a953e213093c871c4775e528bb5481","after":"14c0b67ce9c1aa467887cd000c3cb77e70f084a7","ref":"refs/heads/master","pushedAt":"2023-07-29T06:25:16.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"Solve Acmicpc 14906. 스러피","shortMessageHtmlLink":"Solve Acmicpc 14906. 스러피"}},{"before":"bbcf2eb15847c96755973c701e4dff94ec5ff623","after":"9122cba6c7a953e213093c871c4775e528bb5481","ref":"refs/heads/master","pushedAt":"2023-07-27T07:36:26.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"Solve Acmicpc 10421. 수식 완성하기\n - string보다 interger 연산이 더 빠르다.","shortMessageHtmlLink":"Solve Acmicpc 10421. 수식 완성하기"}},{"before":"56c1250f9ef0553e4cd533e7dc7667cb6c11488d","after":"bbcf2eb15847c96755973c701e4dff94ec5ff623","ref":"refs/heads/master","pushedAt":"2023-07-27T05:52:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"Solve Leetcode 2141. Maximum Running Time of N Computers","shortMessageHtmlLink":"Solve Leetcode 2141. Maximum Running Time of N Computers"}},{"before":"2b40919b948e75603b6b500b3076fd5c10bd0014","after":"56c1250f9ef0553e4cd533e7dc7667cb6c11488d","ref":"refs/heads/master","pushedAt":"2023-07-26T08:50:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"Solve Acmpicpc 25374. 등급 계산하기","shortMessageHtmlLink":"Solve Acmpicpc 25374. 등급 계산하기"}},{"before":"c0fa60d8da3f9431cfa65a49872ef90248eae8b6","after":"2b40919b948e75603b6b500b3076fd5c10bd0014","ref":"refs/heads/master","pushedAt":"2023-07-26T06:18:54.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"docs: rewrite README - append description in blog note","shortMessageHtmlLink":"docs: rewrite README - append description in blog note"}},{"before":"3d9457a87b550e0beadbbd5d41d332d95e26f6c3","after":"c0fa60d8da3f9431cfa65a49872ef90248eae8b6","ref":"refs/heads/master","pushedAt":"2023-07-26T06:17:04.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"Solve Leetcode 1870. Minimum Speed to Arrive on Time","shortMessageHtmlLink":"Solve Leetcode 1870. Minimum Speed to Arrive on Time"}},{"before":"3a382f86ec8c1be5054c4679b3e0b7dbbe0e0163","after":"3d9457a87b550e0beadbbd5d41d332d95e26f6c3","ref":"refs/heads/master","pushedAt":"2023-07-25T11:19:07.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"Fix 2023 CPS festival Qualification Round 6. - problem modified","shortMessageHtmlLink":"Fix 2023 CPS festival Qualification Round 6. - problem modified"}},{"before":"0535794038a7d23d26e81de6159ba18724f49270","after":"3a382f86ec8c1be5054c4679b3e0b7dbbe0e0163","ref":"refs/heads/master","pushedAt":"2023-07-24T15:30:06.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"Participate 2023 CPS festival Qualification Rount","shortMessageHtmlLink":"Participate 2023 CPS festival Qualification Rount"}},{"before":"7fae1f074a807ef066dc69cc93df56fc44c9483c","after":"0535794038a7d23d26e81de6159ba18724f49270","ref":"refs/heads/master","pushedAt":"2023-05-10T00:43:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"Solve Leetcode 59. Spiral Matrix II","shortMessageHtmlLink":"Solve Leetcode 59. Spiral Matrix II"}},{"before":"a5fab4df275d2eeb39c22533c860ab9e733ebca0","after":"7fae1f074a807ef066dc69cc93df56fc44c9483c","ref":"refs/heads/master","pushedAt":"2023-05-09T01:08:09.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"Solve Leetcode 54. Spiral Matrix","shortMessageHtmlLink":"Solve Leetcode 54. Spiral Matrix"}},{"before":"2469abfacab1999193d026dcead08be915b5bfac","after":"a5fab4df275d2eeb39c22533c860ab9e733ebca0","ref":"refs/heads/master","pushedAt":"2023-05-08T00:25:20.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"Solve Leetcode 1572. Matrix Diagonal Sum","shortMessageHtmlLink":"Solve Leetcode 1572. Matrix Diagonal Sum"}},{"before":"bc2d7728d37a8fbddac7a415a32e69f2bd2d0bbb","after":"2469abfacab1999193d026dcead08be915b5bfac","ref":"refs/heads/master","pushedAt":"2023-05-07T12:35:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"Solve Leetcode 1964. Find the Longest Valid Obstacle Course at Each Position","shortMessageHtmlLink":"Solve Leetcode 1964. Find the Longest Valid Obstacle Course at Each P…"}},{"before":"e03b357872dd2e3c7b40ea4689ccd5119d519f88","after":"bc2d7728d37a8fbddac7a415a32e69f2bd2d0bbb","ref":"refs/heads/master","pushedAt":"2023-05-06T12:30:56.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hyelie","name":"Hyeil Jeong","path":"/hyelie","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/51824413?s=80&v=4"},"commit":{"message":"Solve Leetcode 1498. Number of Subsequences That Satisfy the Given Sum Condition","shortMessageHtmlLink":"Solve Leetcode 1498. Number of Subsequences That Satisfy the Given Su…"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEHNZkUwA","startCursor":null,"endCursor":null}},"title":"Activity · hyelie/Algorithm-Log"}