Google - Graph Theory
Graph Theory questions asked by Google
Total: 93
Easy: 18
Medium: 54
Hard: 21
Progress: 0%
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Lexicographically Smallest Permutation Greater Than Target | Visit | Medium | |
| 2 | Longest Balanced Substring I | Visit | Medium | |
| 3 | Minimize Maximum Component Cost | Visit | Medium | |
| 4 | Count Partitions With Max-Min Difference at Most K | Visit | Medium | |
| 5 | Path Existence Queries in a Graph I | Visit | Medium | |
| 6 | Restricted | Restricted | Hard | |
| 7 | Restricted | Restricted | Hard | |
| 8 | Restricted | Restricted | Hard | |
| 9 | Restricted | Restricted | Hard | |
| 10 | Restricted | Restricted | Hard | |
| 11 | Restricted | Restricted | Hard | |
| 12 | Restricted | Restricted | Hard | |
| 13 | Restricted | Restricted | Hard | |
| 14 | Restricted | Restricted | Hard | |
| 15 | Restricted | Restricted | Hard |
Log in to access all 93 questions for free!
Log In