{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":235727414,"defaultBranch":"master","name":"codingTest","ownerLogin":"renine94","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2020-01-23T05:12:52.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/57125936?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1579756374.0","currentOid":""},"activityList":{"items":[{"before":"e2e6d24ce3cb60078a3032a9093466a21750fcdf","after":"915ff6365782fe49d5764f2ddca2b07a0b1f2ccf","ref":"refs/heads/master","pushedAt":"2024-05-08T07:42:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: 높은 점수부터 금은동 메달 점수 매기기","shortMessageHtmlLink":"leetcode: 높은 점수부터 금은동 메달 점수 매기기"}},{"before":"d5451a286218ea2cbc9e45969276bef4a6e84ee8","after":"e2e6d24ce3cb60078a3032a9093466a21750fcdf","ref":"refs/heads/master","pushedAt":"2024-05-07T18:11:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: Linked List - 값 2배 하여 리턴하기 #2","shortMessageHtmlLink":"leetcode: Linked List - 값 2배 하여 리턴하기 #2"}},{"before":"df3ceea89c69bb4b3e5707c1044b3f0fb3540172","after":"d5451a286218ea2cbc9e45969276bef4a6e84ee8","ref":"refs/heads/master","pushedAt":"2024-05-07T07:39:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: Linked List - 값 2배 하여 리턴하기","shortMessageHtmlLink":"leetcode: Linked List - 값 2배 하여 리턴하기"}},{"before":"7053054888c7685360219aa0b795d62ab3ce533b","after":"df3ceea89c69bb4b3e5707c1044b3f0fb3540172","ref":"refs/heads/master","pushedAt":"2024-05-06T16:52:06.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: 링크드리스트 - 오른쪽에 더 큰값 없게 다시만들기","shortMessageHtmlLink":"leetcode: 링크드리스트 - 오른쪽에 더 큰값 없게 다시만들기"}},{"before":"b81eaaa45cf60beb1c3c2d772c19d1d60feb365f","after":"7053054888c7685360219aa0b795d62ab3ce533b","ref":"refs/heads/master","pushedAt":"2024-05-04T08:10:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: 2-point 알고리즘 문제풀이 2 - 보트 수 구하기","shortMessageHtmlLink":"leetcode: 2-point 알고리즘 문제풀이 2 - 보트 수 구하기"}},{"before":"0251aaa3c9d6f8913def38298f6b4d2b1894320a","after":"b81eaaa45cf60beb1c3c2d772c19d1d60feb365f","ref":"refs/heads/master","pushedAt":"2024-04-26T04:49:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: 최소거리 구하기, DP - fallingPath","shortMessageHtmlLink":"leetcode: 최소거리 구하기, DP - fallingPath"}},{"before":"d77524c9b718ea94f12ef8290f8ab1b28c4f2a55","after":"0251aaa3c9d6f8913def38298f6b4d2b1894320a","ref":"refs/heads/master","pushedAt":"2024-04-25T04:29:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: DP, 서브시퀀스 문자열중 가장 긴 문자열길이 찾기","shortMessageHtmlLink":"leetcode: DP, 서브시퀀스 문자열중 가장 긴 문자열길이 찾기"}},{"before":"d5c705cbb9ee9e74c405e766438972942c8dd0e0","after":"d77524c9b718ea94f12ef8290f8ab1b28c4f2a55","ref":"refs/heads/master","pushedAt":"2024-04-24T04:29:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: 트리보나치, 재귀, 캐싱재귀, DP 풀이","shortMessageHtmlLink":"leetcode: 트리보나치, 재귀, 캐싱재귀, DP 풀이"}},{"before":"e7daa9d7cca7b40a0aa1fc8cad0ec889b5bfa6fd","after":"d5c705cbb9ee9e74c405e766438972942c8dd0e0","ref":"refs/heads/master","pushedAt":"2024-04-23T06:47:56.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: 트리탐색, BFS, 트리의 최소높이 찾기 (아직 좀 익숙치않음..)","shortMessageHtmlLink":"leetcode: 트리탐색, BFS, 트리의 최소높이 찾기 (아직 좀 익숙치않음..)"}},{"before":"c300684c4975ce816426b27b541c7c4d882cbd30","after":"e7daa9d7cca7b40a0aa1fc8cad0ec889b5bfa6fd","ref":"refs/heads/master","pushedAt":"2024-04-22T02:51:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: BFS 완전탐색, 자물쇠 열기","shortMessageHtmlLink":"leetcode: BFS 완전탐색, 자물쇠 열기"}},{"before":"be6d35a5f55d818268a501b85e1f426cd2ba5b2f","after":"c300684c4975ce816426b27b541c7c4d882cbd30","ref":"refs/heads/master","pushedAt":"2024-04-21T13:22:43.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: 그래프사이에 유효한 경로가 있는지 찾기, stack을 활용한 그래프탐색 #2","shortMessageHtmlLink":"leetcode: 그래프사이에 유효한 경로가 있는지 찾기, stack을 활용한 그래프탐색 #2"}},{"before":"0dc10d99bac6cc4cc85e08ab9010783206ededc3","after":"be6d35a5f55d818268a501b85e1f426cd2ba5b2f","ref":"refs/heads/master","pushedAt":"2024-04-21T13:14:58.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: 그래프사이에 유효한 경로가 있는지 찾기, stack을 활용한 그래프탐색","shortMessageHtmlLink":"leetcode: 그래프사이에 유효한 경로가 있는지 찾기, stack을 활용한 그래프탐색"}},{"before":"17678afbf281e990f9be58827b71acf077877802","after":"0dc10d99bac6cc4cc85e08ab9010783206ededc3","ref":"refs/heads/master","pushedAt":"2024-04-20T13:11:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: 완전탐색과 방문한곳 체크하여 땅의 시작, 끝 좌표구하기 (dfs, recursive)","shortMessageHtmlLink":"leetcode: 완전탐색과 방문한곳 체크하여 땅의 시작, 끝 좌표구하기 (dfs, recursive)"}},{"before":"49069ad76f56dc4bc135d746a1730ae192c45a2c","after":"17678afbf281e990f9be58827b71acf077877802","ref":"refs/heads/master","pushedAt":"2024-04-20T12:57:33.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: 완전탐색과 방문한곳 체크하여 땅의 시작, 끝 좌표구하기","shortMessageHtmlLink":"leetcode: 완전탐색과 방문한곳 체크하여 땅의 시작, 끝 좌표구하기"}},{"before":"2a9a85750b90bce706e3f8e45e77850f33847109","after":"49069ad76f56dc4bc135d746a1730ae192c45a2c","ref":"refs/heads/master","pushedAt":"2024-04-18T06:38:13.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: 완전탐색 섬의 둘레 길이 구하기 - 파일명 변경","shortMessageHtmlLink":"leetcode: 완전탐색 섬의 둘레 길이 구하기 - 파일명 변경"}},{"before":"01394b0d191ee3473bb5e61fae3b7c643c6ceba5","after":"2a9a85750b90bce706e3f8e45e77850f33847109","ref":"refs/heads/master","pushedAt":"2024-04-18T06:37:43.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: 완전탐색 섬의 둘레 길이 구하기","shortMessageHtmlLink":"leetcode: 완전탐색 섬의 둘레 길이 구하기"}},{"before":"2bbeb0d2475a16798b0984c152d1674701970e4f","after":"01394b0d191ee3473bb5e61fae3b7c643c6ceba5","ref":"refs/heads/master","pushedAt":"2024-04-15T02:57:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: stack, recursive(DFS) 를 활용한 TreeNode 탐색","shortMessageHtmlLink":"leetcode: stack, recursive(DFS) 를 활용한 TreeNode 탐색"}},{"before":"278b242ce88c0a85f0d52a9443d6cd6a0f5d7262","after":"2bbeb0d2475a16798b0984c152d1674701970e4f","ref":"refs/heads/master","pushedAt":"2024-04-14T04:02:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: stack, dfs, recursive 를 활용한 이진트리 탐색","shortMessageHtmlLink":"leetcode: stack, dfs, recursive 를 활용한 이진트리 탐색"}},{"before":"316ec30bae968ec9757e70de93c10d464cbf728d","after":"278b242ce88c0a85f0d52a9443d6cd6a0f5d7262","ref":"refs/heads/master","pushedAt":"2024-04-12T07:04:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: 2-point 알고리즘 문제풀이","shortMessageHtmlLink":"leetcode: 2-point 알고리즘 문제풀이"}},{"before":"c5ed53b7e602d18a6cc5ce56c2bf4ebdf143ba79","after":"316ec30bae968ec9757e70de93c10d464cbf728d","ref":"refs/heads/master","pushedAt":"2024-04-11T05:10:02.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: k개 숫자제거하여 가장 작은수 찾기 (스택 사용)","shortMessageHtmlLink":"leetcode: k개 숫자제거하여 가장 작은수 찾기 (스택 사용)"}},{"before":"3094bcbf828906d99ba3b287dd270fc553c72160","after":"c5ed53b7e602d18a6cc5ce56c2bf4ebdf143ba79","ref":"refs/heads/master","pushedAt":"2024-04-10T17:04:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"algorithm: 재귀, 메모이제이션 피보나치수열","shortMessageHtmlLink":"algorithm: 재귀, 메모이제이션 피보나치수열"}},{"before":"3f43d721337d37c9dfa2906c59dc30545ec49872","after":"3094bcbf828906d99ba3b287dd270fc553c72160","ref":"refs/heads/master","pushedAt":"2024-04-10T04:28:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: 투포인터와 큐시물레이션 사용한 오름차순 덱 표시하기","shortMessageHtmlLink":"leetcode: 투포인터와 큐시물레이션 사용한 오름차순 덱 표시하기"}},{"before":"fea03f1ba1116e8dcc986ebfb463621590686a8a","after":"3f43d721337d37c9dfa2906c59dc30545ec49872","ref":"refs/heads/master","pushedAt":"2024-04-08T02:43:20.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: deque 덱을 이용한 샌드위치 못먹은 학생수 구하기","shortMessageHtmlLink":"leetcode: deque 덱을 이용한 샌드위치 못먹은 학생수 구하기"}},{"before":"4017aab2c4fb802d96ea74033cdc0ba46e9919fa","after":"fea03f1ba1116e8dcc986ebfb463621590686a8a","ref":"refs/heads/master","pushedAt":"2024-04-07T13:14:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: stack 을 활용한 validString 여부 판별","shortMessageHtmlLink":"leetcode: stack 을 활용한 validString 여부 판별"}},{"before":"61d2ab5638a0f086ba655a0b41b40589a15d4517","after":"4017aab2c4fb802d96ea74033cdc0ba46e9919fa","ref":"refs/heads/master","pushedAt":"2024-04-07T13:13:18.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: Stack 이용해서 문제풀이","shortMessageHtmlLink":"leetcode: Stack 이용해서 문제풀이"}},{"before":"4ae19bbc12593e8fd2446c4296863a70317172ba","after":"61d2ab5638a0f086ba655a0b41b40589a15d4517","ref":"refs/heads/master","pushedAt":"2024-04-07T13:10:32.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"git commit test 1","shortMessageHtmlLink":"git commit test 1"}},{"before":"4017aab2c4fb802d96ea74033cdc0ba46e9919fa","after":"4ae19bbc12593e8fd2446c4296863a70317172ba","ref":"refs/heads/master","pushedAt":"2024-04-07T13:08:35.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: stack 을 활용한 validString 여부 판별","shortMessageHtmlLink":"leetcode: stack 을 활용한 validString 여부 판별"}},{"before":"6128e8713bd71cb374fad70e17cf0c11f42a5d2b","after":"4017aab2c4fb802d96ea74033cdc0ba46e9919fa","ref":"refs/heads/master","pushedAt":"2024-04-04T08:16:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: Stack 이용해서 문제풀이","shortMessageHtmlLink":"leetcode: Stack 이용해서 문제풀이"}},{"before":"544fbcaa0d662ea64517525810f331b50e268ca6","after":"6128e8713bd71cb374fad70e17cf0c11f42a5d2b","ref":"refs/heads/master","pushedAt":"2024-04-03T13:31:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"coding test - 프로그래머스 레벨2 풀어보기","shortMessageHtmlLink":"coding test - 프로그래머스 레벨2 풀어보기"}},{"before":"98c0b973856072183060c99f28351384547462bc","after":"544fbcaa0d662ea64517525810f331b50e268ca6","ref":"refs/heads/master","pushedAt":"2024-04-02T04:16:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"renine94","name":"Jaegu Kang","path":"/renine94","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/57125936?s=80&v=4"},"commit":{"message":"leetcode: 동형 문자 판별하기","shortMessageHtmlLink":"leetcode: 동형 문자 판별하기"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAERFhrMQA","startCursor":null,"endCursor":null}},"title":"Activity · renine94/codingTest"}