백준과 프로그래머스 등 알고리즘 문제 풀이 코드를 관리합니다.
This repository contains solutions and notes for algorithm training. It is organized to help track progress and manage solution files effectively. Each directory corresponds to a category of algorithms, and each solution is named according to its problem ID on Baekjoon Site or Progammers Site.
The repository is organized as follows:
- Sorting: Contains problems related to sorting algorithms.
- Graph Theory: Contains problems involving graphs, traversals, and graph-related algorithms.
- Dynamic Programming: Solutions for dynamic programming problems.
- Data Structures: Contains implementations and problem solutions related to data structures.
- Greedy Algorithms: Solutions for greedy algorithm problems.
- Mathematics: Mathematical problems including number theory, combinatorics, etc.
Each directory includes:
- Solution Files:
.javaor.pyfiles containing solution code. - Explanation Files:
.mdfiles explaining the problem approach and solution details.
graph TD
A[baekjoon-algorithm-training]
A --> B[Sorting]
A --> C[Graph Theory]
A --> D[Dynamic Programming]
A --> E[Data Structures]
A --> F[Greedy Algorithms]
A --> G[Mathematics]
- Ensure you have Java (or Kotlin) installed on your system to run the solution files.
- Basic knowledge of algorithms and data structures is recommended for a better understanding.
- Clone the repository from GitHub.
- Navigate to the project directory.
- Navigate to a specific algorithm category folder.
- Open the solution file for a particular problem to see the solution code and explanations.
The following is the approximate distribution of problems solved in each algorithm category:
- Baekjoon Online Judge: 50%
- Progammers: 50%
This project is licensed under the MIT License - see the LICENSE file for details.
For any questions or suggestions, please reach out to [email protected]
Happy coding and good luck with your algorithm training on Baekjoon!