BOJ 2644 촌수계산

https://www.acmicpc.net/problem/2644

https://github.com/simjaemun2/BaekJoon/blob/f863f80281b64f325831043f2d57789e125de9b6/BOJ10799/BOJ10799.cpp

분류 : LCA(Least Common Ancestor), Tree, Recursive, BFS

난이도 : M

BOJ 2636 치즈

https://www.acmicpc.net/problem/2636

https://github.com/simjaemun2/BaekJoon/blob/0eda2c30e1e6c46784d6a4faf143bdfe865f4708/BOJ2636/BOJ2636.cpp

분류 : BFS, 큐

난이도 : MH

N의 크기가 작기 때문에, STL queue를 이용하지 않아도 될 것 같다.

BOJ 7569 토마토

https://www.acmicpc.net/problem/7569

https://github.com/simjaemun2/BaekJoon/blob/007a3143c10d5e1f1d91d05c03dc751e2275b69e/BOJ7569/BOJ7569.cpp

분류 : 큐, BFS

난이도 : MH

https://www.acmicpc.net/problem/7576  의 3차원 버전

BOJ 2178 미로 탐색

https://www.acmicpc.net/problem/2178

https://github.com/simjaemun2/BaekJoon/blob/7eec1ec2e63cdde478f2da64e766da031f9a974b/BOJ2178/BOJ2178.cpp

분류 : BFS

난이도 : M

BOJ 2667 단지번호붙이기

https://www.acmicpc.net/problem/2667

https://github.com/simjaemun2/BaekJoon/blob/7abcb386e2254bf130a4f192011c4879d9f1a414/BOJ2667/BOJ2667.cpp

분류 : DFS, BFS, 재귀

난이도 : M

BOJ 2606 바이러스

https://www.acmicpc.net/problem/2606

https://github.com/simjaemun2/BaekJoon/blob/083c02a7f2e35c435e083e55cb23aebf6b386cc9/BOJ2606/BOJ2606.cpp

분류 : DFS, BFS, 재귀

난이도 : M

BOJ 10830 행렬 제곱

https://www.acmicpc.net/problem/10830

https://github.com/simjaemun2/BaekJoon/blob/a15f61e0f7faf19a9de297a3fee30c0d1c36b341/BOJ10830/BOJ10830.cpp

분류 : 행렬

난이도 : MH

BOJ 1629 곱셈

https://www.acmicpc.net/problem/1629

https://github.com/simjaemun2/BaekJoon/blob/86b5b4671774913db60122cae06c1fb771c49546/BOJ1629/BOJ1629.cpp

분류 : 분할정복

난이도 : MH

BOJ 1697 숨바꼭질

https://www.acmicpc.net/problem/1697

https://github.com/simjaemun2/BaekJoon/blob/d8213944d77473c63610c100cc0a801093d4e81a/BOJ1697/BOJ1697.cpp

분류 : queue, bfs

난이도 : MH

BOJ 12851 숨바꼭질 2

https://www.acmicpc.net/problem/12851

https://github.com/simjaemun2/BaekJoon/blob/50b26d93070e3808b5441cd4a6d1f7b6a98079ca/BOJ12851/BOJ12851.cpp

분류 : queue, bfs

난이도 : MH

BOJ 13549 숨바꼭질 3

https://www.acmicpc.net/problem/13549

https://github.com/simjaemun2/BaekJoon/commit/27b0e633567238816e9b57d036bdb0ab415f1f75

분류 : queue, bfs

난이도 : MH

BOJ 2740 행렬 곱셈

https://www.acmicpc.net/problem/2740

https://github.com/simjaemun2/BaekJoon/blob/10dfcfac6496e51907229f80f30ff288109e02d2/BOJ13392/BOJ13392.cpp

분류 : 행렬

난이도 : M

https://www.acmicpc.net/submit/1181

https://github.com/simjaemun2/BaekJoon/blob/395622398c9c813dc3e106887d9dfb64bf1ef61b/BOJ1181/BOJ118818.cpp

분류 : 정렬

난이도 : M

[BOJ 10808 알파벳 개수]

https://www.acmicpc.net/problem/10808

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ10808/BOJ10808.cpp

분류 : 기본 cache

난이도 : M

[BOJ 10809 알파벳 찾기]

https://www.acmicpc.net/problem/10809

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ10809/BOJ10809.cpp

분류 : 기본 cache

난이도 : M

[BOJ2589] 보물섬

https://www.acmicpc.net/problem/2589

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ2589/BOJ2589.cpp

BFS 기본

난이도 : M

[Clone Graph]

https://leetcode.com/problems/clone-graph/

[Copy List with Random Pointer]

https://leetcode.com/problems/copy-list-with-random-pointer/

HashTable, BFS를 이용하여 푼다.

[Symmetric Tree]

https://leetcode.com/problems/symmetric-tree/

DFS

[Minimum Depth of Binary Tree]

https://leetcode.com/problems/minimum-depth-of-binary-tree/

DFS로 구현, BFS로도 구현 가능

[Excel Sheet Column Number]

https://leetcode.com/problems/excel-sheet-column-number/

math