1) https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/global-maximum/?utm_source=header&utm_medium=search&utm_campaign=he-search
2) Connected sum problem on Graphs:
Given a number of nodes and a list of connected pairs, determine the weights of each isolated set of nodes assuming each node weights 1 unit. Then for each weight calculated, sum the ceiling of its square root and return the final sum.
Eg:
Graph_nodes = 10
Graph_from=[1,1,2,3,7]
Graph_to=[2,3,4,5,8]
like: 1>2, 1>3, 2>4, 2>5, 7>8, .. 6,9,10 are isolated