SDE - Intern

Ninja is an avid story lover. Today, he decides to go to the famous Storyteller of Ninjaland to listen to new stories. The Storyteller takes 'Y' coins to tell one story. The Storyteller has also put on a special offer for Ninja that for every 'X' story that the Storyteller tells to Ninja, the Storyteller will tell one story to Ninja free of cost, i.e., without taking any extra coins. Ninja currently has 'Z' coins with himself. He wants to know how many stories the Storyteller will tell him if he goes to the Storyteller with 'Z' coins.

It was a busy day at Ninja's Stock Exchange as stock prices fluctuated throughout the day. Trading isn't Ninja's cup of tea, so he appointed you to help him.

You are given 'Q' queries, each query of type-1 is an update query in which you are given ‘{Name, Price}’ denoting the name of the stock that needs to be updated with the given price, for every query of type-2 you need to find the maximum money that can be collected by selling the top 'K' stocks at that particular moment of time.

The closing price of a particular stock is equal to its last updated price. Find the total money that can be collected after selling at most ‘K’ stocks for every query of type-2.

Note :

Then given queries are in the form of a stream (they are sequential), so they should be processed in the given order. That is: you should not solve them offline by iterating through the back or by iterating in any other order.

For Example :

If N = 4 , K = 2 and Queries = { 1, “a,” 30 }, { 1, “b,” 20 } , { 1, “a,” 10 } , { 1, “c,” 100 } , { 2 }

There is a query of type-2 after processing four queries of type-1.
Then we can sell in the possible ways: 
Sell “a” and “b” and collect 10 + 20 = 30.
Sell “b” and “c” and collect 20 + 100 = 120.
Sell “a” and “c” and collect 10 + 100 = 110.

Therefore we can collect a maximum of 120. Note that “a” is being sold at 10 and not 30 because the last updated price in the stream for “a” was 10.

You have been given a binary tree of 'N' nodes. Print the Spiral Order traversal of this binary tree.

For example

For the given binary tree [1, 2, 3, -1, -1, 4, 5, -1, -1, -1, -1]
    1
   / \
  2   3
     / \
    4   5

Output: 1 3 2 4 5

• Tell me about yourself.
• Why are you interested in this role?
• What are your strengths and weaknesses?
• Where do you see yourself in 5 years?