Business Analyst

Given two sorted arrays 'a' and 'b' of size 'n' and 'm' respectively.

Find the median of the two sorted arrays.

Median is defined as the middle value of a sorted list of numbers. In case the length of list is even, median is the average of the two middle elements.

The expected time complexity is O(min(logn, logm)), where 'n' and 'm' are the sizes of arrays 'a' and 'b', respectively, and the expected space complexity is O(1).

Example:

Input: 'a' = [2, 4, 6] and 'b' = [1, 3, 5]

Output: 3.5

Explanation: The array after merging 'a' and 'b' will be { 1, 2, 3, 4, 5, 6 }. Here two medians are 3 and 4. So the median will be the average of 3 and 4, which is 3.5.

You are given an array/list ‘arr’ of size ‘N’. Find the maximum sum of the elements of the array you can obtain after flipping the sign of exactly ‘K’ elements

For example :

Let arr = [-2, 0, 5, -1, 2]
and K = 4

We will output 10 as we replace -2 by 2, -1 by 1, 0 by 0, and 0 by 0.

Note :

We can apply the flip operation to the same element multiple times

• What is RAID structure in OS? What are the different levels of RAID configuration?
• What is virtual memory?
• Explain paging?
• Define Page Replacement Algorithms?

• What are keys? Explain different kinds of keys.
• What are joins?
• What is normalization?

Step 1 : Get the number to check for palindrome.

Step 2 : Hold the number in temporary variable.

Step 3 : Reverse the number.

Step 4 : Compare the temporary number with reversed number.

Step 5 : If both numbers are same, print "palindrome number"

Step 6 : Else print "not palindrome number"

• Tell me about yourself
• What are your biggest achievements till now?
• What motivated you to join Hyper Verge?
• Where do you see yourself in 5 years