# Categories
참고: https://github.com/xiaoylu/leetcode_category

DFS
---
문제: https://leetcode.com/tag/depth-first-search/
#### 2차원 배열에서 상하좌우 방문하기
- 원래는 dx, dy 로 했는데, 아래와 같은 방법도 깔끔해보인다

for x,y in [[i-1,j],[i+1,j],[i,j-1],[i,j+1]]:
    ...

BFS
---
문제: https://leetcode.com/tag/breadth-first-search/

Connected Component
---
- 문제중에 연결되어있는 섬이나 땅을 탐색하는 문제를 connected component 문제라고 부른다.
- 보통 DFS 또는 BFS 로 문제를 해결하는데, 방문한 노드 (visited node)를 체크하면서 연결된 component를 탐색하는 것이 특징이다.

Back Tracking
---
https://leetcode.com/tag/backtracking/

Stack
---
https://leetcode.com/tag/stack/

Queue
---
https://leetcode.com/tag/queue/

Priority Queue
---
https://leetcode.com/tag/heap-priority-queue/

Dynamic Programming
---
https://leetcode.com/tag/dynamic-programming/

Shortest Path
---
https://leetcode.com/tag/shortest-path/

Two Pointers
---
https://leetcode.com/tag/two-pointers/

Union Find
---
https://leetcode.com/tag/union-find/

Trie
---
https://leetcode.com/tag/trie/