# Question of recent google online assessment.

1. Consider you were given a graph(adjacency matrix) and weights of the graph(array = [12,17,15,11,9]). You have to pair the elements such that adjacent nodes of graph should not be in the pair. This way you have to maximize the sum of the absolute differences of the node weights.
   Note: There can be nodes left without pairing.
   Time Limit : 5 sec

2. Consider you were given a binary string S (max size(10^5)). You have to find the no of unique subsequences of S modulo 10^9+7;
   Time Limit : 1 sec