Java Developer

Given a Binary Tree of 'N' nodes, find and print a list containing the sums of all the diagonals. When calculating the sum of each diagonal, consider the diagonals from right to left.

Diagonals of the binary tree are :

There are three diagonals :

Diagonal 1 : 8 10 14

Diagonal 2 : 3 6 7 13

Diagonal 3 : 1 4

Example :

For the given binary tree : 

Output : 24 14 2

Explanation: Rightmost diagonal contains elements {5, 10 , 9} its sum is 24, middle diagonal contains elements {6, 3, 5} its sum is 14, leftmost diagonal contains elements {2}. Thus the answer should be “24 14 2”.

You are given ‘N’ strings, and you would like to sort them in lexicographical order (A string 'S' is lexicographically ordered before 'T' if 'S' occurs before 'T' in the English dictionary i.e alphabetical ordering).

However, you cannot swap or change the positions of any strings. The only operation you can do is reverse some of the strings. Each string has a cost associated with it, and reversing a string ‘Str[i]’ costs ‘Cost[i]’ rupees.

Calculate the minimum cost required to make all the strings lexicographically ordered, or report that it is impossible by printing -1.

For example :

 If the strings are [‘ba’, ‘ac’] and the cost array is [3,2], reversing the second string costs ‘2’ rupees and sorts the strings. It can be proved that this is the least possible cost that can be achieved. 

Why you want to join Tcs?

Where do you see yourself in 5 years?