SDE - Intern

You have been given a sorted array/list of integers 'arr' of size 'n' and an integer 'x'.

Find the total number of occurrences of 'x' in the array/list.

Example:

Input: 'n' = 7, 'x' = 3
'arr' = [1, 1, 1, 2, 2, 3, 3]

Output: 2

Explanation: Total occurrences of '3' in the array 'arr' is 2.

Given an array of numbers, find the maximum sum of any contiguous subarray of the array.

For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since we would take elements 42, 14, -5, and 86.

Given the array [-5, -1, -8, -9], the maximum sum would be -1.

Follow up: Do this in O(N) time.

You have been given an integer 'num'. Write a function to calculate descriptive word form of the number.

Use the Indian standard unit of numbering.

Example :

If the given input is 62, the output should be 'Sixty two' (without quotes).

Similarly, if the input is 1000000, the output should be 'Ten lakh'.

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]