{"id":19673682,"url":"https://github.com/vsfe/algorithm_study","last_synced_at":"2025-04-04T14:03:55.111Z","repository":{"id":43918002,"uuid":"325976721","full_name":"VSFe/Algorithm_Study","owner":"VSFe","description":"This repository consists of materials for those preparing for coding tests and algorithm interviews.","archived":false,"fork":false,"pushed_at":"2023-03-21T11:34:10.000Z","size":83794,"stargazers_count":719,"open_issues_count":2,"forks_count":84,"subscribers_count":6,"default_branch":"main","last_synced_at":"2025-03-28T13:06:39.804Z","etag":null,"topics":["coding-test","problem-solving"],"latest_commit_sha":null,"homepage":"","language":"C++","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/VSFe.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}},"created_at":"2021-01-01T12:40:25.000Z","updated_at":"2025-03-28T08:54:25.000Z","dependencies_parsed_at":"2025-01-04T10:04:47.474Z","dependency_job_id":null,"html_url":"https://github.com/VSFe/Algorithm_Study","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/VSFe%2FAlgorithm_Study","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/VSFe%2FAlgorithm_Study/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/VSFe%2FAlgorithm_Study/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/VSFe%2FAlgorithm_Study/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/VSFe","download_url":"https://codeload.github.com/VSFe/Algorithm_Study/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247190231,"owners_count":20898700,"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","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":["coding-test","problem-solving"],"created_at":"2024-11-11T17:15:58.077Z","updated_at":"2025-04-04T14:03:55.076Z","avatar_url":"https://github.com/VSFe.png","language":"C++","readme":"Algorithm_Study\n================\n\n알고리즘 강의 및 과외에서 사용하는 자료입니다.\n\n강의 및 과외 문의는 이메일로 부탁드립니다.\n\n현재는 Python으로만 자료를 제공하고 있습니다. 추후 C++ 및 Java Solution 코드도 추가 예정입니다.\n\n---\n\n## 자료 현황\n\n현재 리뉴얼 작업 중에 있습니다.\n\n해당 링크에 있는 자료들은 기본 개념 pdf, 추천 문제 목록 및 solution 으로 구성되어 있습니다.\n\n|단원|링크|상태|\n|---|---|---|\n|자료구조|||\n|완전탐색, 백트래킹|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/New/02_Bruteforcing)|기본 개념 완성, 문제 solution 예정|\n|정렬|||\n|이진탐색|||\n|그리디 알고리즘|||\n|그래프 탐색|||\n|시뮬레이션, 구현|||\n|그래프 알고리즘|||\n|부분합, 투포인터|||\n|다이나믹 프로그래밍|||\n|트리|||\n|위상정렬|||\n\n### 기존 자료\n\n리뉴얼 전 기존 자료들을 확인할 수 있습니다.\n\n[vol.2](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2)\n--\n|단원|링크|\n|---|---|\n|코테용 파이썬|[링크](https://github.com/VSFe/Algorithm_Study/blob/main/Concept/Prev/vol.2/00_Special/Pythonic_Code_For_Coding_Test.md)|\n|자료구조|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/01_Data_Structure)|\n|완전탐색, 백트래킹|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/New/02_Bruteforcing)|\n|정렬|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/03_Sorting)|\n|이진탐색|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/04_Binary_Search)|\n|그리디 알고리즘|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/05_Greedy)|\n|그래프 탐색|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/06_Graph_Traversal)|\n|그래프 알고리즘|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/08_Graph_Algorithm)|\n|부분합, 투포인터|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/09_Two_Pointer)|\n|다이나믹 프로그래밍|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/10_Dynamic_Programming)|\n|트리|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/11_Tree)|\n\n\n[vol.1](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.1)\n- \n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvsfe%2Falgorithm_study","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvsfe%2Falgorithm_study","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvsfe%2Falgorithm_study/lists"}