Representation

1. https://leetcode.com/problems/minimum-degree-of-a-connected-trio-in-a-graph/

BFS

1. https://leetcode.com/problems/word-ladder/
2. https://leetcode.com/problems/word-ladder-ii/
3. https://codeforces.com/problemset/problem/1037/D
4. https://leetcode.com/problems/shortest-path-visiting-all-nodes/

DFS

1. https://www.hackerrank.com/challenges/journey-to-the-moon/problem
2. https://leetcode.com/problems/reconstruct-itinerary/submissions/
3. https://leetcode.com/problems/maximum-path-quality-of-a-graph/
4. https://leetcode.com/problems/couples-holding-hands/

Cycle Detection

1. Cycle detection Directed graph
2. Cycle detection Undirected graph
3. Bipartite
4. https://leetcode.com/problems/course-schedule/
5. https://leetcode.com/problems/course-schedule-ii/
6. https://leetcode.com/problems/detect-cycles-in-2d-grid/
7. Shortest Cycle in an undirected Graph
8. Detecting odd len cycle (Bipartite)
9. https://leetcode.com/problems/maximum-employees-to-be-invited-to-a-meeting/

DAG

1. https://leetcode.com/problems/all-paths-from-source-to-target/
2. https://leetcode.com/problems/largest-color-value-in-a-directed-graph/

MST

1. https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/
2. https://leetcode.com/problems/min-cost-to-connect-all-points/
3. https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/

DSU

1. https://leetcode.com/problems/redundant-connection-ii/

Trie

1. https://www.codingninjas.com/codestudio/problems/implement-trie_631356
2. https://www.codingninjas.com/codestudio/problems/implement-trie_1387095
3. https://www.codingninjas.com/codestudio/problems/complete-string_2687860
4. https://www.codingninjas.com/codestudio/problems/count-distinct-substrings_985292
5. https://www.codingninjas.com/codestudio/problems/maximum-xor_973113
6. https://www.codingninjas.com/codestudio/problems/max-xor-queries_1382020
7. https://leetcode.com/problems/word-search-ii/

DP

1. https://codeforces.com/problemset/problem/577/B
2. https://leetcode.com/problems/cherry-pickup/
3. https://codeforces.com/problemset/problem/225/C