BOJ 2583 영역 구하기

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

https://github.com/simjaemun2/BaekJoon/blob/6923d7f013f058c12428ce7e4884ce6b9e86ec0b/BOJ2583/BOJ2583.cpp

난이도 : M

DFS

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

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

난이도 : MH

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

난이도 : MH

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

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

DFS

Graph Cycle 검출

[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

[Palindrome Partitioning]

https://leetcode.com/problems/palindrome-partitioning/

def dfs(sublist, str)

if not str

ret += sublist

else

for str의 0번 인덱스 시작 길이가 1부터 len(str)까지의 모든 substring

if substring is palindrome

dfs(sublist += substring, str에서 substring을 제외한 나머지)

[Binary Tree Preorder, Inorder, Postorder]

https://leetcode.com/problems/binary-tree-preorder-traversal/

https://leetcode.com/problems/binary-tree-inorder-traversal/

https://leetcode.com/problems/binary-tree-postorder-traversal/

stack, hash

reverse(preorder) = postorder