Roots of the tree having minimum height

80
25 mins
0.6k
Number of squareful arrays

120
50 mins
0.2k
Count Strongly Connected Components (Kosaraju’s Algorithm)

120
40 mins
2.7k
Find the City With the Smallest Number of Neighbors at a Threshold Distance

80
15 mins
0.3k
Validate Binary Tree Nodes

80
15 mins
0.1k
Shortest alternate colored path

80
20 mins
0.8k
Path With Maximum Probability

80
25 mins
0.1k
Sort Integers by Factor Value

80
30 mins
0.1k
Number of Connected Computers.

80
10 mins
0.2k
Path to the nearest service station

80
15 mins
0.2k