Problem title
Difficulty
Avg time to solve

Angle Between Hour Hand And Minute Hand
Easy
15 mins
3 Divisors
Moderate
25 mins
Maximum Length of Chain
Moderate
15 mins
Distinct Paths
Moderate
20 mins
Rearrange words in a sentence
Easy
15 mins
Count Valid Pairs
Moderate
25 mins
Largest cake
Moderate
10 mins
Word Boggle
Ninja
--
Evaluate Division
Moderate
15 mins
Disjoint Intervals
Moderate
30 mins
Report an issue
Properties of MST in a Undirected Graph
MULTIPLE CHOICE

G = (V,E) is an undirected simple graph in which each edge has a distinct weight, and e is a particular edge of G. Which of the following statements about the minimum spanning trees (MSTs) of G is/are TRUE?

I. If e is the lightest edge of some cycle in G, then every MST of G includes e 
II. If e is the heaviest edge of some cycle in G, then every MST of G excludes e 
Options: