LeetCode
Daily Grind
Today's Problem
Graph Theory
Medium
2316 · Count Unreachable Pairs of Nodes in an Undirected Graph
Open on LeetCode →Today's Results
—
🐙Niklas
—
Simeon
—
🏔️Tomas
—
🌺Darian
—
🌊Louis
—
🌊Jonas
—
🎮Vasushmasu
—
🗡️Edea
—
😈KillerBunny
—
Kent
—
TschaiLatte
—
JonasG
—
Estelle
—
E-Mail
—
Julius
—
🌛Mark
—
🌸Xa4
Leaderboard
1
🏔️Tomas
No streak
· avg 2h 3m
107 / 144
74.3%
2
🐙Niklas
No streak
· avg 41m 15s
88 / 144
61.1%
3
😈KillerBunny
No streak
· avg 6m 43s
61 / 144
42.4%
4
🌊Louis
No streak
· avg 4m 40s
37 / 144
25.7%
5
🌺Darian
No streak
· avg 1m 23s
32 / 144
22.2%
6
Julius
No streak
· avg 9m 11s
31 / 144
21.5%
7
🌊Jonas
No streak
· avg 35m 39s
22 / 144
15.3%
8
JonasG
No streak
· avg 3m 48s
21 / 144
14.6%
9
🌛Mark
No streak
· avg 6m 59s
16 / 144
11.1%
10
🗡️Edea
No streak
· avg 1m 20s
13 / 144
9.0%
11
Estelle
No streak
· avg 57s
11 / 144
7.6%
12
🎮Vasushmasu
No streak
· avg 3m 16s
9 / 144
6.2%
13
Kent
No streak
· avg 17m 48s
9 / 144
6.2%
14
Simeon
No streak
· avg 0s
5 / 144
3.5%
15
TschaiLatte
No streak
· avg 16m 19s
5 / 144
3.5%
16
E-Mail
No streak
· avg 57s
4 / 144
2.8%
17
🌸Xa4
No streak
· avg 0s
1 / 144
0.7%
Analytics
Solve time per problem (seconds)
Failed submissions per problem
Recent History
Full history →
| Date | Problem | Difficulty | Set | 🐙Niklas | Simeon | 🏔️Tomas | 🌺Darian | 🌊Louis | 🌊Jonas | 🎮Vasushmasu | 🗡️Edea | 😈KillerBunny | Kent | TschaiLatte | JonasG | Estelle | Julius | 🌛Mark | 🌸Xa4 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2026-09-08 | 2316 Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | Graph Theory | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-09-07 | 152 Maximum Product Subarray | Medium | Dynamic Programming | ○ | ○ | ✓3 | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-09-06 | 64 Minimum Path Sum | Medium | Dynamic Programming | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-09-05 | 18 4Sum | Medium | Two Pointers | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-09-04 | 133 Clone Graph | Medium | Graph Theory | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-09-03 | 464 Can I Win | Medium | Probability DP | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-09-02 | 1552 Magnetic Force Between Two Balls | Medium | Binary Search | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-09-01 | 130 Surrounded Regions | Medium | Graph Theory | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-31 | 63 Unique Paths II | Medium | Dynamic Programming | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-30 | 62 Unique Paths | Medium | Dynamic Programming | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-29 | 142 Linked List Cycle II | Medium | Two Pointers | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-28 | 1857 Largest Color Value in a Directed Graph | Hard | Graph Theory | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-27 | 886 Possible Bipartition | Medium | Matching & Assignment | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-26 | 1155 Number of Dice Rolls With Target Sum | Medium | Expected Value | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-25 | 797 All Paths From Source to Target | Medium | Bottleneck Paths & DAGs | ✓2 | ○ | ✓6 | ○ | ○ | ✓ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-24 | 785 Is Graph Bipartite? | Medium | Matching & Assignment | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-23 | 1349 Maximum Students Taking Exam | Hard | Matching & Assignment | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ✓ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-22 | 1553 Minimum Number of Days to Eat N Oranges | Hard | Expected Value | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-21 | 2492 Minimum Score of a Path Between Two Cities | Medium | Bottleneck Paths & DAGs | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-20 | 1595 Minimum Cost to Connect Two Groups of Points | Hard | Matching & Assignment | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-19 | 956 Tallest Billboard | Hard | Expected Value | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-18 | 1697 Checking Existence of Edge Length Limited Paths | Hard | Bottleneck Paths & DAGs | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-17 | 1879 Minimum XOR Sum of Two Arrays | Hard | Matching & Assignment | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-16 | 1947 Maximum Compatibility Score Sum | Medium | Matching & Assignment | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-15 | 494 Target Sum | Medium | Expected Value | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-14 | 1631 Path With Minimum Effort | Medium | Bottleneck Paths & DAGs | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-13 | 826 Most Profit Assigning Work | Medium | Matching & Assignment | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-12 | 2400 Number of Ways to Reach a Position After Exactly k Steps | Medium | Expected Value | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-11 | 778 Swim in Rising Water | Hard | Bottleneck Paths & DAGs | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |
| 2026-08-10 | 2071 Maximum Number of Tasks You Can Assign | Hard | Matching & Assignment | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ | ○ |