SDE - 2

Write code for a Splitwise type application which simplifies the debts among a group of friends, and displays how much every person owes.Eg. A owes Rs. 10 to BB owes Rs. 5 to AA owes Rs. 15 to CC owes Rs. 20 to DD owes Rs. 12 to BB owes Rs. 15 to DB owes Rs. 10 to ESo the solution should be:A owes Rs. 5 to B and Rs. 20 in totalB owes Rs. 3 to D and Rs. 13 in totalC owes Rs. 20 to D and Rs. 20 in totalD does not owe anythingE does not owe anything

Given the count of total stones in a game. Two-player ‘Ale’ and ‘Bob’ are playing the game. Your task is to find who will win the game if both the players are playing optimally.

Rules of the game.

1. In a single turn, a player can choose a single stone or ‘even’ number of stones.

2. They will play alternatively, which means in the first chance ‘Ale’ will collect the stones, in second-chance ‘Bob’ will collect the stones. And always ‘Ale’ will start the game.

3. If any player is not able to take any stones then another player will win the game.

You are given a network with ‘N’ system nodes [0 to N - 1] and ‘M’ connection. Your task is to find out all critical connections in a given network.

Note: A connection between node ‘u’ and ‘v’ is said to be a critical connection, if after removal of a connection ‘u’ - ‘v’, there is no connection between node ‘u’ and ‘v’ and the network goes down.

For example:

For given N = 4, M = 4, 

The connection between system node 0 and 1 is a critical connection.

Design a Vending Machine

Why should we hire you?

What keeps you motivated?