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 7576 토마토

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

https://github.com/simjaemun2/BaekJoon/blob/23aaa1e66caa9c8076abe4941e534b50c938edbd/BOJ7576/BOJ7576.cpp

분류 : 큐

난이도 : MH

완전 탐색을 여러 번 중첩하는 방법은 시간 초과를 한다.

따라서, 두 개의 큐를 이용해 토마토가 한 단계식 익는 과정을 저장한다.

BOJ 2178 미로 탐색

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

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

분류 : 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

[Implement Stack using Queues]

https://leetcode.com/problems/implement-stack-using-queues/

[Implement Queue using Stacks]

https://leetcode.com/problems/implement-queue-using-stacks/

stack, queue를 2개씩 만들어서, 하나의 stack or queue에 pop()할 item을 하나씩 유지

[Simplify Path]

https://leetcode.com/problems/simplify-path/

stack

Python "///".split("/") = ['','','',''] 과 같이 리턴