SDE - 1

When a person knows a story and meets someone, he immediately shares the story at that timeStamp. Initially, only person 1 knows the story. You are given a list of meetings between people in the array ‘arr’ where each meeting is in the form of (person1, person2, timeStamp) where ‘person1‘ will tell the story to ‘person2’ at time ‘timeStamp’. Your task is to construct the list of people in sorted order who will know the story at the end.

For example:

Consider ‘arr’ = [(1, 2, 100), (3, 4, 200), (1, 3, 300), (2, 5, 400)] 

Person 1 will tell the story to person 2  at 100th timeStamp.
Person 1 will tell the story to person 3 at 300th timeStamp.
Person 2 will tell the story to person 5 at 400th timeStamp.
Person 4 will not be able to learn the story. 

So the output will be [1, 2, 3, 5].

You are given an array(PRICES) of stock prices for N consecutive days. Your task is to find the maximum profit that you can make by completing as many transactions as you like, where a transaction denotes buying one and selling one share of the stock.

Note:

You must sell the stock before you buy it again.

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

Introduce yourself.

What do you know about the work culture here?

Tell me about your family background?

What do you think are your strengths and weaknesses?