Senior Software Engineer

A thief is robbing a store and can carry a maximum weight of ‘W’ into his knapsack. There are 'N' items available in the store and the weight and value of each item is known to the thief. Considering the constraints of the maximum weight that a knapsack can carry, you have to find the maximum profit that a thief can generate by stealing items.

Note: The thief is not allowed to break the items.

For example, N = 4, W = 10 and the weights and values of items are weights = [6, 1, 5, 3] and values = [3, 6, 1, 4]. Then the best way to fill the knapsack is to choose items with weight 6, 1 and 3. The total value of knapsack = 3 + 6 + 4 = 13.

You are given an unweighted directed graph of 'V' vertices and 'E' edges. Your task is to print all the strongly connected components (SCCs) present in the graph.

Design a Cricket Score Board. The Score Board should have: 
a. Runs scored by the current batsmen
b. Ball wise over history of what event took place on that ball (4, 6, wicket) 
c. Innings should switch over smoothly. 
d. Target countdown, runrate computation is a plus.
e. With the inputs given, the scoreboard should recognise which team won and tag that event's winner.