# quizzes & solutions

### Rule

* 문제를 보고 1시간 이내에 답을 만들어 제출해본다.
* 답을 제출하기 전에는 스스로 테스트케이스를 만들어서 의도한대로 동작하는지 확인한다.
* 1시간 이내에 답이 나오지 않거나 테스트를 통과하지 못할 경우 다른 사람의 답을 참고하여 어디가 문제인지 확인한다.

### 탐색

#### - 순열 & 조합

* [백준 - 2309(일곱난쟁이)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/2309.py)
* [백준 - 6603(로또)](https://www.acmicpc.net/problem/6603)
* [백준 - 10974(모든 순열)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/10974.py)
* [백준 - 10972(다음 순열)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/10972.py)
* [백준 - 10973(이전 순열)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/10973.py)
* [백준 - 10819(차이를 최대로)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/10819.py)
* [백준 - 10971(외판원 순회 2)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/10971.py)
* [백준 - 14889(스타트와 링크)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/14889_combination.py)
* [백준 - 15649(N과 M(1))](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/15649.py)
* [백준 - 15650(N과 M(2))](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/15650.py)
* [백준 - 15651(N과 M(3))](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/15651.py)
* [백준 - 15652(N과 M(4))](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/15652.py)
* [백준 - 15654(N과 M(5))](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/15654.py)
* [백준 - 15655(N과 M(6))](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/15655.py)
* [백준 - 1759(암호 만들기)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/1759_combinations.py)
* [프로그래머스  - 소수 찾기](https://github.com/dev-daeun/algo-quiz/blob/master/programmers/%EC%BD%94%EB%94%A9%ED%85%8C%EC%8A%A4%ED%8A%B8-%EC%97%B0%EC%8A%B5/find_prime_number.py)

#### - 완전탐색

* [백준 - 8035(사탕 게임)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/3085.py)
* [백준 - 1476(날짜 계산)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/1476.py)
* [백준 - 6064(카잉 달력)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/6064.py)

#### - 비트마스크

* [백준 - 1182(부분수열의 합)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/1182.py)
* [백준 - 14889(스타트와 링크)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/14889_bitmask.py)
* [백준 - 14391(종이 조각)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/14391.py)

#### - 백트래킹

* [백준 - 2529(부등호)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/2529.py)
* [백준 - 9663(N-Queen)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/9663.py)
* [백준 - 1987(알파벳)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/1987.py)
* [백준 - 1987(알파벳, 다른 풀이)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/1987_another.py)
* [백준 - 2580(스도쿠)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/2580.py)

### Dynamic Programming

* [백준 - 12865(평범한 배낭)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/12865.py)
* [백준 - 14501(퇴사)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/14501.py)

### 탐욕법

### 정렬

#### - heap sort

* [leetcode - 912. Sort an array](https://github.com/dev-daeun/algo-quiz/blob/master/leetcode/912.py)

#### - tim sort (Python built-in sort)

* [백준 - 10814(나이순 정렬)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/10814.py) 
* [백준 - 11004(K번째 수)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/11004.py)

### 링크리스트

### 그래프

* [백준 - 1260(DFS와 BFS, 인접리스트 구현)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/1260_adjacent_list.py)
* [백준 - 1260(DFS와 BFS, 인접행렬 구현)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/1260_adjacent_matrix.py)

#### - DFS

* [백준 - 11724(연결 요소의 개수)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/11724_dfs.py)
* [백준 - 1707(이분 그래프)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/1707_dfs.py)
* [백준 - 4963(섬의 개수)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/4963_dfs.py)
* [백준 - 16929(Two Dots)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/16929.py)
* [백준 - 14502(연구소)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/14502_dfs.py)
* [프로그래머스 - 타겟 넘버](https://github.com/dev-daeun/algo-quiz/blob/master/programmers/%EC%BD%94%EB%94%A9%ED%85%8C%EC%8A%A4%ED%8A%B8-%EC%97%B0%EC%8A%B5/target_number.py)
* [leetcode - 207. Course Schedule](https://github.com/dev-daeun/algo-quiz/blob/master/leetcode/207.py)

#### - BFS

* [백준 - 11724(연결 요소의 개수)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/11724_bfs.py)
* [백준 - 1707(이분 그래프)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/1707_bfs.py)
* [백준 - 4963(섬의 개수)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/4963_bfs.py)
* [백준 - 7562(나이트의 이동)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/7562.py)
* [백준 - 14502(연구소)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/14502_bfs.py)
* [백준 - 11725(트리의 부모 찾기)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/11725.py)
* [백준 - 1167(트리의 지름)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/1167.py)
* [백준 - 1697(숨바꼭질)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/1697.py)
* [백준 - 13913(숨바꼭질 4)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/13913.py)
* [백준 - 13549(숨바꼭질 3)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/13549.py)
* [백준 - 14226(이모티콘)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/14226.py)
* [백준 - 1261(알고스팟)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/1261.py)

### 트리

* [백준 - 1068(트리)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/1068.py)

### 힙 트리 

* [백준 - 11279(최대 힙)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/11279.py)

### Disjoint Set

* [codewars - Dynamic Connectivity](https://github.com/dev-daeun/algo-quiz/blob/master/codewars/dynamic_connectivity.py)
* [백준 - 4195(친구 네트워크)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/4195.py)
* [백준 - 1717(집합의 표현)](https://github.com/dev-daeun/algo-quiz/blob/master/baekjoon/1717.py)

### 이진 탐색 트리

### AVL Tree

### Splay Tree

### Hashing