SDE - 1

You are given a sentence in the form of a string ‘S’. You have to convert ‘S’ into its equivalent mobile numeric keypad sequence, i.e. print the sequence in such a way that if it is typed on the given keypad, the output should be the string ‘S’. A keypad for the reference is shown below.

Note:

1. There will be only lower case letters.
2. There will not be any special characters or capital letters in the input string.
3. There will be no spaces in the string.

You are given an array of size ‘N’ which is an array representation of min-heap.

You need to convert this min-heap array representation to a max-heap array representation. Return the max-heap array representation.

For Example

Corresponding to given min heap : [1,2,3,6,7,8]

It can be converted to the following max heap: [8,7,3,6,2,1]

You are given an array/list 'prices' where the elements of the array represent the prices of the stock as they were yesterday and indices of the array represent minutes. Your task is to find and return the maximum profit you can make by buying and selling the stock. You can buy and sell the stock only once.

Note:

You can’t sell without buying first.

For Example:

For the given array [ 2, 100, 150, 120],
The maximum profit can be achieved by buying the stock at minute 0 when its price is Rs. 2 and selling it at minute 2 when its price is Rs. 150.
So, the output will be 148.

Given a binary tree, return the maximum absolute difference between a node and its ancestor, for any ancestor-node pair in the binary tree.

The ancestor of any node is defined as the node/nodes which come above the current node in the binary tree. For example, the root node is ancestor of every node in the binary tree.

For example :

In the above figure, we have many nodes which have a node and ancestor relationship.

Some of them are, and their difference is:

|1-4|=3
|2-4|=2
|3-4|=1
|6-4|=2
|7-4|=3
And more

Out of all the possible parent ancestor pairs, the one with the maximum absolute difference is between nodes (7 and 4) and (1 and 4) which is 3. Therefore, the answer to this case is 3.