{"id":27965918,"url":"https://github.com/pollra/algorithm-study","last_synced_at":"2026-02-13T13:41:51.232Z","repository":{"id":208336970,"uuid":"721381370","full_name":"pollra/algorithm-study","owner":"pollra","description":null,"archived":false,"fork":false,"pushed_at":"2023-11-21T00:34:29.000Z","size":2,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-08-20T03:57:16.310Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/pollra.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2023-11-21T00:13:53.000Z","updated_at":"2023-11-21T00:40:49.000Z","dependencies_parsed_at":null,"dependency_job_id":"93789f4e-296c-48ca-b590-d32799e7fcb3","html_url":"https://github.com/pollra/algorithm-study","commit_stats":null,"previous_names":["pollra/coding-test"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/pollra/algorithm-study","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pollra%2Falgorithm-study","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pollra%2Falgorithm-study/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pollra%2Falgorithm-study/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pollra%2Falgorithm-study/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/pollra","download_url":"https://codeload.github.com/pollra/algorithm-study/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pollra%2Falgorithm-study/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":274902703,"owners_count":25371078,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-09-12T02:00:09.324Z","response_time":60,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-05-07T20:15:35.801Z","updated_at":"2026-02-13T13:41:46.197Z","avatar_url":"https://github.com/pollra.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# 알고리즘 스터디\n\n## 진행 방식\n\n이 알고리즘 스터디는 특정 언어를 기준으로 만들어지는 스터디가 아닙니다\n다양한 언어를 사용하며 각자의 풀이 방식과 개선점을 이야기 하는 스터디 입니다\n\n오후 3시에 문제를 지정하고 다음날 오후 3시 까지 문제풀이를 진행합니다\n\n* 스터디 참여자는 해당 Repository 에서 Main 브랜치를 upstream 으로 두고 fork 받습니다\n* upstream 의 개인 브랜치에 최초 push 합니다(이 때 프로젝트 기본 셋팅도 포함됩니다)\n* 아래의 문제 목록에서 문제를 선택하고 풀이를 진행합니다\n* 오후 3시 이전까지 PR 을 올려놓습니다. 이 때, 정답 화면을 반드시 첨부합니다.\n\n문제는 논의 된 대로 Programmers 의 Kakao 문제를 풀 것이며, 정답률이 높은 순서대로 풀이를 진행합니다\n\n## 문제 목록\n\n- [ ] [Level.2] [두 큐 합 같게 만들기](https://school.programmers.co.kr/learn/courses/30/lessons/118667)\n- [ ] [Level.1] [성격 유형 검사하기](https://school.programmers.co.kr/learn/courses/30/lessons/118666)\n- [ ] [Level.1] [개인정보 수집 유효기간](https://school.programmers.co.kr/learn/courses/30/lessons/150370)\n- [ ] [Level.2] [이모티콘 할인행사](https://school.programmers.co.kr/learn/courses/30/lessons/150368)\n- [ ] [Level.2] [택배 배달과 수거하기](https://school.programmers.co.kr/learn/courses/30/lessons/150369)\n- [ ] [Level.3] [미로 탈출 명령어](https://school.programmers.co.kr/learn/courses/30/lessons/150365)\n- [ ] [Level.3] [표현 가능한 이진트리](https://school.programmers.co.kr/learn/courses/30/lessons/150367)\n- [ ] [Level.3] [등산코스 정하기](https://school.programmers.co.kr/learn/courses/30/lessons/118669)\n- [ ] [Level.3] [표 병합](https://school.programmers.co.kr/learn/courses/30/lessons/150366)\n- [ ] [Level.3] [코딩 테스트 공부](https://school.programmers.co.kr/learn/courses/30/lessons/118668)\n\n추가적으로 위 문제를 다 푼 경우 아래의 문제를 자유롭게 도전해도 됩니다\n\n- [ ] [Level.4] [행렬과 연산](https://school.programmers.co.kr/learn/courses/30/lessons/118670)\n- [ ] [Level.4] [1,2,3 떨어트리기](https://school.programmers.co.kr/learn/courses/30/lessons/150364)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpollra%2Falgorithm-study","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpollra%2Falgorithm-study","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpollra%2Falgorithm-study/lists"}