https://github.com/vsfe/algorithm_study
This repository consists of materials for those preparing for coding tests and algorithm interviews.
https://github.com/vsfe/algorithm_study
coding-test problem-solving
Last synced: 10 months ago
JSON representation
This repository consists of materials for those preparing for coding tests and algorithm interviews.
- Host: GitHub
- URL: https://github.com/vsfe/algorithm_study
- Owner: VSFe
- License: mit
- Created: 2021-01-01T12:40:25.000Z (about 5 years ago)
- Default Branch: main
- Last Pushed: 2023-03-21T11:34:10.000Z (almost 3 years ago)
- Last Synced: 2025-03-28T13:06:39.804Z (10 months ago)
- Topics: coding-test, problem-solving
- Language: C++
- Homepage:
- Size: 79.9 MB
- Stars: 719
- Watchers: 6
- Forks: 84
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
Algorithm_Study
================
알고리즘 강의 및 과외에서 사용하는 자료입니다.
강의 및 과외 문의는 이메일로 부탁드립니다.
현재는 Python으로만 자료를 제공하고 있습니다. 추후 C++ 및 Java Solution 코드도 추가 예정입니다.
---
## 자료 현황
현재 리뉴얼 작업 중에 있습니다.
해당 링크에 있는 자료들은 기본 개념 pdf, 추천 문제 목록 및 solution 으로 구성되어 있습니다.
|단원|링크|상태|
|---|---|---|
|자료구조|||
|완전탐색, 백트래킹|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/New/02_Bruteforcing)|기본 개념 완성, 문제 solution 예정|
|정렬|||
|이진탐색|||
|그리디 알고리즘|||
|그래프 탐색|||
|시뮬레이션, 구현|||
|그래프 알고리즘|||
|부분합, 투포인터|||
|다이나믹 프로그래밍|||
|트리|||
|위상정렬|||
### 기존 자료
리뉴얼 전 기존 자료들을 확인할 수 있습니다.
[vol.2](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2)
--
|단원|링크|
|---|---|
|코테용 파이썬|[링크](https://github.com/VSFe/Algorithm_Study/blob/main/Concept/Prev/vol.2/00_Special/Pythonic_Code_For_Coding_Test.md)|
|자료구조|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/01_Data_Structure)|
|완전탐색, 백트래킹|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/New/02_Bruteforcing)|
|정렬|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/03_Sorting)|
|이진탐색|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/04_Binary_Search)|
|그리디 알고리즘|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/05_Greedy)|
|그래프 탐색|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/06_Graph_Traversal)|
|그래프 알고리즘|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/08_Graph_Algorithm)|
|부분합, 투포인터|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/09_Two_Pointer)|
|다이나믹 프로그래밍|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/10_Dynamic_Programming)|
|트리|[링크](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.2/11_Tree)|
[vol.1](https://github.com/VSFe/Algorithm_Study/tree/main/Concept/Prev/vol.1)
-