https://leetcode.

com/problems/checking-existence-of-edge-length-limited-paths/
2421. Number of Good Paths || googlw oa question 2022
https://leetcode.com/problems/greatest-common-divisor-traversal/ || beri beri noice
question
2467. Most Profitable Path in a Tree || not done
2477. Minimum Fuel Cost to Report to the Capital
Find eventual safe states
https://leetcode.com/problems/sum-of-distances-in-tree/
2440. Create Components With Same Value || beri op

Longest cycle in graph

2392. Build a Matrix With Conditions ** || TOPO SORT
1376. Time Needed to Inform All Employees
surrounded regions
codefoces --> kefa and park, split into two sets
1202. Smallest String With Swaps**
2421. Number of Good Paths** || google oa
Number of Distinct Islands || beri op, we have to store the shapes
https://leetcode.com/contest/weekly-contest-299/problems/minimum-score-after-
removals-on-a-tree/
Alien dictionary**
https://leetcode.com/problems/detonate-the-maximum-bombs/
2477. Minimum Fuel Cost to Report to the Capital

1519. Number of Nodes in the Sub-Tree With the Same Label

word ladder 2
Minimum Multiplications to reach End || gfg
. Minimize Malware Spread beri op
2360. Longest Cycle in a Graph || done
947. Most Stones Removed with Same Row or Column || do using dsu
990. Satisfiability of Equality Equations
2065. Maximum Path Quality of a Graph
https://leetcode.com/problems/second-minimum-time-to-reach-destination/
Course Schedule III
Min Cost to Connect All Points
2039. The Time When the Network Becomes Idle
1928. Minimum Cost to Reach Destination in Time ****** beri beri op dijkstra || idk
we can creater adj list here
765. Couples Holding Hands
evaluate divisions
All Ancestors of a Node in a Directed Acyclic Graph || do using bfs
2368. Reachable Nodes With Restrictions
2065. Maximum Path Quality of a Graph
2203. Minimum Weighted Subgraph With the Required Paths || not done
2316. Count Unreachable Pairs of Nodes in an Undirected Graph || dsu
Cheapest Flight within k stops || bellman ford --> tempDist array
797. All Paths From Source to Target || bfs
2290. Minimum Obstacle Removal to Reach Corner || OP DIJKSTRA
802. Find Eventual Safe States || Modified dfs for cycle detection
2316. Count Unreachable Pairs of Nodes in an Undirected Graph ||DSU
1368. Minimum Cost to Make at Least One Valid Path in a Grid??
847. Shortest Path Visiting All Nodes || bitmask
2192. All Ancestors of a Node in a Directed Acyclic Graph || do using toposort
1192. Critical Connections in a Network || Bridges in graph
Course Schedule IV || topo sort
swim in rising water || dijkstra
learn bridges in graph
redundant connection 2
2045. Second Minimum Time to Reach Destination || not done
 || dijkstra, do using dfs
number of islands || dsu.
Number of Ways to Arrive at Destination
359. Find Closest Node to Given Two Nodes || do using dijkstra too