Associate Software Engineer

Ninja is given a few numbers, and he is being asked to rearrange the numbers so that every second element is greater than its left and right element.

Suppose the given array is [1, 2, 3, 4, 5] then the rearranged array can be [1, 3, 2, 5, 4].

You are given two strings 'A' and 'B' where string 'A' is fixed. But you can perform left shift operations on string B any number of times.

Your task is to find out the minimum number of left-shift operations required in order to obtain the longest common prefix of string 'A' and 'B'.

Note:

Left shift is defined as a single circular rotation on the string after which the first character becomes the last character and all other characters are shifted one index to the left.

For Example:

If A = “an”, B = “can”.
After performing one left shift operation, string B becomes “anc”.
After performing two left shift operations, string B becomes “nca”.

Follow Up:

Can you solve this in linear time and space complexity?

1. What is the main purpose of an operating system?
2. What is the difference between process and program?
3. What is the use of paging in operating system?
4. What is the concept of demand paging?

1. What is Normalization and why do we use it?
2. Write an SQL query to find the position of the alphabet (‘o’) in the first name column ‘Zemoso’ from Company table.
3. Write an SQL query to fetch duplicate records having matching data in some fields of a table.

You are given an integer array ‘ARR’. You have to find the length of the shortest contiguous subarray such that, if you sort this subarray in ascending order, then the whole array will be sorted in ascending order.

An array 'C' is a subarray of array 'D' if it can be obtained by deletion of several elements(possibly zero) from the beginning and the end from array 'D'.

Example:

Let’s say we have an array 'ARR' {10, 12, 20, 30, 25, 40, 32, 31, 35, 50, 60}. Then we have to find the subarray {30 , 25 , 40 , 32 , 31 , 35} and print its length = 5 as our output. Because, when we sort this subarray the whole array will be sorted.

You have ten stacks of ten coins each and each of them weighs 10 gm. However, one of the stacks is faulty and each of the coins in it weighs only 9 gms. What is the least number of times you have to weigh to find the faulty coin?