0% found this document useful (0 votes)
154 views8 pages

Mastering Graph Problems in 100 Days

The document discusses a 100-day study plan for solving graph-related problems, covering approximately 100 challenges on LeetCode. It emphasizes mastering basic algorithms such as depth-first search (DFS) and breadth-first search (BFS) before progressing to more advanced topics. The author also provides links to previous study guides on two pointers and dynamic programming.

Uploaded by

Prateek Goyal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
154 views8 pages

Mastering Graph Problems in 100 Days

The document discusses a 100-day study plan for solving graph-related problems, covering approximately 100 challenges on LeetCode. It emphasizes mastering basic algorithms such as depth-first search (DFS) and breadth-first search (BFS) before progressing to more advanced topics. The author also provides links to previous study guides on two pointers and dynamic programming.

Uploaded by

Prateek Goyal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

23/05/2025, 21:40 Solved all Graph problems in 100 days- Discuss - LeetCode

Explore Problems Contest Discuss Interview Store 0

Solved all Graph problems in 100


days
chuka231
6763 Sep 09, 2024 Sep 09, 2024
Graph Career

I wanted to study graph-related problems and


concepts, so I went through all the graph-tagged
problems—around 100 in total, excluding non-
public and pure tree problems. Graph theory is a
broad field with many algorithms and patterns,
but I suggest mastering Parts 1 and 2 first,
especially depth-first search (DFS) and breadth-
first search (BFS). Part 3 covers many
applications and combinations of these basics,
which are essential to cover for top companies
that are highly competitive in the current market.
My previous lists in case you haven't seen:
[Link] pointers:
[Link]
guide/1688903/solved-all-two-pointers-
problems-in-100-days
[Link]:
[Link]
guide/1000929/solved-all-dynamic-
programming-dp-problems-in-7-months
//===================================
============
Part I - Basics of Graph
//===================================
============
1-1 Simple DFS/BFS
[Link]
[Link]
[Link]
[Link] 1/8
23/05/2025, 21:40 Solved all Graph problems in 100 days- Discuss - LeetCode

videos-by-your-friends
[Link]
exists-in-graph
[Link]
maximum-bombs
1-2 Count Degrees
[Link]
judge
[Link]
number-of-vertices-to-reach-all-nodes
[Link]
network-rank
[Link]
degree-of-a-connected-trio-in-a-graph
[Link]
nodes
[Link]
star-graph
[Link]
importance-of-roads
[Link]
highest-edge-score
[Link]
sum-of-a-graph
[Link]
make-degrees-of-all-nodes-even
[Link]
1-3 Topological Sorting
[Link]
[Link]
schedule-ii
[Link] Explore
source-to-target
[Link] #Interview
safe-states Amazon Interview Rescheduling C…
[Link] Rippling Phone Screen [Reject]
groups-respecting-dependencies
[Link] #Compensation
a-node-in-a-directed-acyclic-graph When Effort Isn't Enough: A Candi…
[Link]
schedule-iv Lattice Semiconductors | L10 | Pune
[Link] #Career
[Link] 2/8
23/05/2025, 21:40 Solved all Graph problems in 100 days- Discuss - LeetCode

[Link] Amazon Interview Rescheduling C…


iii When Effort Isn't Enough: A Candi…
[Link]
recipes-from-given-supplies #Google
[Link]
with-conditions Google L4, Hyderabad DS/MLE Int…
Google team matching
1-4 Connected Component/Union Find (Disjoint-
set) Show More
[Link]
provinces Support Terms Privacy Policy More
[Link] Copyright © 2025 LeetCode
connection United States
[Link]
connection-ii
[Link]
removed-with-same-row-or-column
[Link]
equality-equations
[Link]
of-a-matrix
[Link]
operations-to-make-network-connected
[Link]
number-of-edges-to-keep-graph-fully-
traversable
[Link]
existence-of-edge-length-limited-paths
[Link]
restricted-friend-requests
[Link]
with-secret
[Link]
unreachable-pairs-of-nodes-in-an-undirected-
graph
[Link]
of-a-path-between-two-cities
[Link]
number-of-complete-components
1-5 Bipartite
[Link]
bipartite
[Link] 3/8
23/05/2025, 21:40 Solved all Graph problems in 100 days- Discuss - LeetCode

[Link]
bipartition
//===================================
============
Part II - Medium level topics of Graph
//===================================
============
2-1 BFS Variants (0-1 BFS, multi-source BFS)
[Link]
trees
[Link]
malware-spread
[Link]
malware-spread-ii
[Link]
candies-you-can-get-from-boxes
2-2 Shortest Path - Dijkstra Algorithm
[Link]
time
[Link]
nodes-in-subdivided-graph
[Link]
maximum-probability
[Link]
to-make-at-least-one-valid-path-in-a-grid
[Link]
restricted-paths-from-first-to-last-node
[Link]
to-reach-destination-in-time
[Link]
to-arrive-at-destination
[Link]
the-network-becomes-idle
[Link]
minimum-time-to-reach-destination
[Link]
weighted-subgraph-with-the-required-paths
[Link]
obstacle-removal-to-reach-corner
[Link]
of-a-path-with-special-roads
[Link] 4/8
23/05/2025, 21:40 Solved all Graph problems in 100 days- Discuss - LeetCode

[Link]
to-visit-a-cell-in-a-grid
[Link]
edge-weights
2-3 Shortest Path - Bellman–Ford Algorithm
[Link]
with-alternating-colors
[Link]
within-k-stops
2-4 Shortest Path - Floyd–Warshall Algorithm
99 11
[Link]
with-the-smallest-number-of-neighbors-at-a-
threshold-distance
[Link]
with-shortest-path-calculator
[Link]
possible-sets-of-closing-branches
[Link]
to-convert-string-i
[Link]
to-convert-string-ii
[Link]
number-of-houses-at-a-certain-distance-i
2-5 Cycle Detection
[Link]
value-in-a-directed-graph
[Link]
employees-to-be-invited-to-a-meeting
[Link]
node-to-given-two-nodes
[Link]
a-graph
[Link]
in-a-graph
[Link]
nodes-in-a-directed-graph
2-6 Minimum Spanning Tree - Kruskal's
Algorithm
[Link]
pseudo-critical-edges-in-minimum-spanning-
tree
[Link] 5/8
23/05/2025, 21:40 Solved all Graph problems in 100 days- Discuss - LeetCode

[Link]
connect-all-points
//===================================
============
Part III - Rare/Advanced topics of Graph
//===================================
============
3-1 Euler Tour
[Link]
itinerary
[Link]
arrangement-of-pairs
3-2 De Bruijn Sequence
[Link]
safe
3-3 Game on Graph
[Link]
[Link]
3-4 Graph Cloning
[Link]
3-5 Construction
[Link]
of-a-node-sequence
[Link]
hands
3-6 Hamilton Cycle/Travelling Sellsman
[Link]
visiting-all-nodes
3-7 Tarjan's Algorithm
[Link]
connections-in-a-network
3-8 DP applications
[Link]
quality-of-a-graph
[Link]
ii
[Link]
[Link] 6/8
23/05/2025, 21:40 Solved all Graph problems in 100 days- Discuss - LeetCode

with-no-adjacent
[Link]
[Link]
increasing-path-in-a-matrix
[Link]
increasing-paths-in-a-grid
3-9 Ad-Hoc
[Link]
to-reconstruct-a-tree
[Link]
into-the-maximum-number-of-groups
[Link]
number-of-houses-at-a-certain-distance-ii

Comments (11) Sort by: Best

Type comment here...

Comment

subrmanyam Sep 29, 2024


Liked your 2 pointer and DP posts and was waiting
for your next post, Thanks You
6 Reply

Kaushal Shinde Sep 09, 2024


Bookmarked ✔ great segregation of problems,
PART III is an absolute GEM💎
5 Reply

Aaishpra Nov 23, 2024


Thanks chuka, this is exactly what i was looking for

[Link] 7/8
23/05/2025, 21:40 Solved all Graph problems in 100 days- Discuss - LeetCode
1 Reply

Aditya Oct 13, 2024


great to see this
1 Reply

Aditya kumar Sep 16, 2024


You did really amazing work! Thank you !
1 Reply

NGUYEN HUU LAI Sep 15, 2024


thank you, master
1 Reply

Aditya Sinha Sep 10, 2024


Your are legend
1 Reply

rntongoo May 12, 2025


Could you do one on PrefixSum or RangeSum
Queries ? This one on Graphs is perfect
0 Reply

rntongoo May 12, 2025


This is excellent thank you so much
0 Reply

Nirav Rathod Feb 15, 2025


GEM💎
0 Reply

1 2
[Link] 8/8

You might also like