Skip to content

Commit 2b4bdb4

Browse files
enginebaienginebai
committed
Remark and organize graph problems
1 parent 5beb659 commit 2b4bdb4

File tree

2 files changed

+31
-29
lines changed

2 files changed

+31
-29
lines changed

‎problems/graph-problems.md

Lines changed: 31 additions & 28 deletions
Original file line numberDiff line numberDiff line change
@@ -3,55 +3,57 @@
33
| Problem | Difficulty |
44
|------------------|------------|
55
|[841. Keys and Rooms](../leetcode/841.keys-and-rooms.md)|Medium (1412)|
6-
|[733. Flood Fill](../leetcode/733.flood-fill.md)|Easy|
6+
|**[733. Flood Fill](../leetcode/733.flood-fill.md)**|Easy|
77
|[463. Island Perimeter](../leetcode/463.island-perimeter.md)|Easy|
8-
|[133. Clone Graph](../leetcode/133.clone-graph.md)|Medium|
8+
|@@**[133. Clone Graph](../leetcode/133.clone-graph.md)**|Medium|
99
|[2316. Count Unreachable Pairs of Nodes in an Undirected Graph](../leetcode/2316.count-unreachable-pairs-of-nodes-in-an-undirected-graph.md)|Medium (1604)|
1010
|[1319. Number of Operations to Make Network Connected](../leetcode/1319.number-of-operations-to-make-network-connected.md)|Medium (1633)|
11-
|[417. Pacific Atlantic Water Flow](../leetcode/417.pacific-atlantic-water-flow.md)|Medium|
12-
|[79. Word Search](../leetcode/79.word-search.md)|Medium|
13-
|[399. Evaluate Division](../leetcode/399.evaluate-division.md)|Medium|
14-
|[2192. All Ancestors of a Node in a Directed Acyclic Graph](../leetcode/2192.all-ancestors-of-a-node-in-a-directed-acyclic-graph.md)|Medium (1787)|
11+
|**[417. Pacific Atlantic Water Flow](../leetcode/417.pacific-atlantic-water-flow.md)**|Medium|
12+
|**[79. Word Search](../leetcode/79.word-search.md)**|Medium|
13+
|**[399. Evaluate Division](../leetcode/399.evaluate-division.md)**|Medium|
14+
|@@[2192. All Ancestors of a Node in a Directed Acyclic Graph](../leetcode/2192.all-ancestors-of-a-node-in-a-directed-acyclic-graph.md)|Medium (1787)|
1515
|[1559. Detect Cycles in 2D Grid](../leetcode/1559.detect-cycles-in-2d-grid.md)|Medium (1837)|
1616
|[2101. Detonate the Maximum Bombs](../leetcode/2101.detonate-the-maximum-bombs.md)|Medium (1880)|
1717
|~~[2492. Minimum Score of a Path Between Two Cities](../leetcode/2492.minimum-score-of-a-path-between-two-cities.md)~~|Medium (1679)|
1818

1919
> * https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/description/ 1512
2020
> * https://leetcode.com/problems/number-of-enclaves/description/ 1615
21-
> * https://leetcode.com/problems/number-of-provinces/description/
21+
> * **https://leetcode.com/problems/number-of-provinces/description/**
2222
2323
### Connected Components (Closed Islands)
2424
| Problem | Difficulty |
2525
|------------------|------------|
26-
|[200. Number of Islands](../leetcode/200.number-of-islands.md)|Medium|
27-
|[695. Max Area of Island](../leetcode/695.max-area-of-island.md)|Medium|
28-
|[130. Surrounded Regions](../leetcode/130.surrounded-regions.md)|Medium|
26+
|**[200. Number of Islands](../leetcode/200.number-of-islands.md)**|Medium|
27+
|**[695. Max Area of Island](../leetcode/695.max-area-of-island.md)**|Medium|
28+
|**[130. Surrounded Regions](../leetcode/130.surrounded-regions.md)**|Medium|
2929
|[1254. Number of Closed Islands](../leetcode/1254.number-of-closed-islands.md)|Medium (1659)|
30-
|[1905. Count Sub Islands](../leetcode/1905.count-sub-islands.md)|Medium|
31-
|[827. Making A Large Island](../leetcode/827.making-a-large-island.md)|Hard (1934)|
30+
|@@[1905. Count Sub Islands](../leetcode/1905.count-sub-islands.md)|Medium|
31+
|@@[827. Making A Large Island](../leetcode/827.making-a-large-island.md)|Hard (1934)|
3232

3333
### BFS
3434
| Problem | Difficulty |
3535
|------------------|------------|
36-
|[994. Rotting Oranges](../leetcode/994.rotting-orange.md)|Medium|
36+
|@@**[994. Rotting Oranges](../leetcode/994.rotting-orange.md)**|Medium|
3737
|[433. Minimum Genetic Mutation](../leetcode/433.minimum-genetic-mutation.md)|Medium|
3838
|[1926. Nearest Exit from Entrance in Maze](../leetcode/1926.nearest-exit-from-entrance-in-maze.md)|Medium (1638)|
3939
|[1162. As Far from Land as Possible](../leetcode/1162.as-far-from-land-as-possible.md)|Medium (1666)|
4040
|[1129. Shortest Path with Alternating Colors](../leetcode/1129.shortest-path-with-alternating-colors.md)|Medium (1779)|
41-
|[934. Shortest Bridge](../leetcode/934.shortest-bridge.md)|Medium (1825)|
42-
|[127. Word Ladder](../leetcode/127.word-ladder.md)|Hard|
43-
|[1293. Shortest Path in a Grid with Obstacles Elimination](../leetcode/1293.shortest-path-in-a-grid-with-obstacles-elimination.md)|Hard (1967)|
41+
|@@**[934. Shortest Bridge](../leetcode/934.shortest-bridge.md)**|Medium (1825)|
42+
|@@**[127. Word Ladder](../leetcode/127.word-ladder.md)**|Hard|
43+
|@@**[1293. Shortest Path in a Grid with Obstacles Elimination](../leetcode/1293.shortest-path-in-a-grid-with-obstacles-elimination.md)**|Hard (1967)|
44+
45+
> * **https://leetcode.com/problems/bus-routes/description/** 1964
4446
4547
### Shortest Path Faster Algorithm (SPFA)
4648
| Problem | Difficulty |
4749
|------------------|------------|
48-
|[542. 01 Matrix](../leetcode/542.01-matrix.md)|Medium|
49-
|[1514. Path with Maximum Probability](../leetcode/1514.path-with-maximum-probability.md)|Medium|
50+
|**[542. 01 Matrix](../leetcode/542.01-matrix.md)**|Medium|
51+
|@@**[1514. Path with Maximum Probability](../leetcode/1514.path-with-maximum-probability.md)**|Medium|
5052

5153
### Tree-like
5254
| Problem | Difficulty |
5355
|------------------|------------|
54-
|[1443. Minimum Time to Collect All Apples in a Tree](../leetcode/1443.minimum-time-to-collect-all-apples-in-a-tree.md)|Medium (1682)|
56+
|**[1443. Minimum Time to Collect All Apples in a Tree](../leetcode/1443.minimum-time-to-collect-all-apples-in-a-tree.md)**|Medium (1682)|
5557
|[1530. Number of Good Leaf Nodes Pairs](../leetcode/1530.number-of-good-leaf-nodes-pairs.md)|Medium (1745)|
5658

5759
> * https://leetcode.com/problems/number-of-nodes-in-the-sub-tree-with-the-same-label/description/ 1809
@@ -66,35 +68,36 @@
6668
### Topological Sort
6769
| Problem | Difficulty |
6870
|------------------|------------|
69-
|[207. Course Schedule](../leetcode/207.course-schedule.md)|Medium|
71+
|@@**[207. Course Schedule](../leetcode/207.course-schedule.md)**|Medium|
7072
|[210. Course Schedule II](../leetcode/210.course-schedule-ii.md)|Medium|
71-
|[2115. Find All Possible Recipes from Given Supplies](../leetcode/2115.find-all-possible-recipes-from-given-supplies.md)|Medium (1679)|
72-
|[310. Minimum Height Trees](../leetcode/310.minimum-height-trees.md)|Medium|
73+
|@@[2115. Find All Possible Recipes from Given Supplies](../leetcode/2115.find-all-possible-recipes-from-given-supplies.md)|Medium (1679)|
74+
|**[310. Minimum Height Trees](../leetcode/310.minimum-height-trees.md)**|Medium|
7375

7476
> * https://leetcode.com/problems/course-schedule-iv/description/ 1692
75-
> * https://leetcode.com/problems/find-eventual-safe-states/description/ 1962
77+
> * **https://leetcode.com/problems/find-eventual-safe-states/description/** 1962
7678
> * https://leetcode.com/problems/parallel-courses-iii/ 2084
7779
7880
### Bipartite
7981
| Problem | Difficulty |
8082
|------------------|------------|
81-
|[785. Is Graph Bipartite?](../leetcode/785.is-graph-bipartite.md)|Medium|
83+
|**[785. Is Graph Bipartite?](../leetcode/785.is-graph-bipartite.md)**|Medium|
8284
|[886. Possible Bipartition](../leetcode/886.possible-bipartition.md)|Medium|
8385

8486
### Shortest Path
8587
| Problem | Difficulty |
8688
|------------------|------------|
87-
|[787. Cheapest Flights Within K Stops](../leetcode/787.cheapest-flights-within-k-stops.md)|Medium|
88-
|[743. Network Delay Time](../leetcode/743.network-delay-time.md)|Medium|
89+
|**[787. Cheapest Flights Within K Stops](../leetcode/787.cheapest-flights-within-k-stops.md)**|Medium|
90+
|**[743. Network Delay Time](../leetcode/743.network-delay-time.md)**|Medium|
8991
|[1091. Shortest Path in Binary Matrix](../leetcode/1091.shortest-path-in-binary-matrix.md)|Medium|
90-
|[1631. Path With Minimum Effort](../leetcode/1631.path-with-minimum-effort.md)|Medium (1947)|
92+
|**[1631. Path With Minimum Effort](../leetcode/1631.path-with-minimum-effort.md)**|Medium (1947)|
9193

9294
> TODO: Problems listing from https://huxulm.github.io/lc-rating/list/graph
9395
9496
### To Classify
9597
| Problem | Difficulty |
9698
|------------------|------------|
97-
|[684. Redundant Connection](../leetcode/684.redundant-connection.md)|Medium|
99+
|**[684. Redundant Connection](../leetcode/684.redundant-connection.md)**|Medium|
98100
|[980. Unique Paths III](../leetcode/980.unique-paths-iii.md)|Hard|
99101
> * Solved: https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/description/
102+
> * **https://leetcode.com/problems/accounts-merge/** 5k m
100103

‎problems/string-problems.md

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,6 @@
1919

2020
#### Problem Listing
2121
> * https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/ 5k m
22-
> * https://leetcode.com/problems/accounts-merge/ 5k m
2322
> * Solved: https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/description/ 3k e
2423
> ----
2524
> * https://leetcode.com/problems/repeated-string-match/ 2k m

0 commit comments

Comments
 (0)