Application Engineer

You are given an array/list ‘BINARYNUMS’ that consists of ‘N’ distinct strings which represent all integers from 0 to N in binary representation except one integer. This integer between 0 to ‘N’ whose binary representation is not present in list ‘BINARYNUMS’ is called ‘Missing Integer’.

Your task is to find the binary representation of that ‘Missing Integer’. You should return a string that represents this ‘Missing Integer’ in binary without leading zeros.

Note

1. There will be no leading zeros in any string in the list ‘BINARYNUMS’.

Example:

Consider N = 5 and the list ‘binaryNums’=  [“0”, “01”, “010”, “100”, “101”].  This list consists of the binary representation of numbers [0, 1, 2, 4, 5]. Clearly, the missing number is 3 and its binary representation will be “11”. So you should return string “11”.

You are given an array ‘ARR’ of length ‘N’. There are two operations, ‘FIRST_SUM’ and ‘LAST_SUM’ for every index ‘i’ (1 <= i <= N) in the array,

i) FIRST_SUM(i) calculates the sum of first i numbers.

ii) LAST_SUM(i) calculates the sum of last N-i+1 numbers.

Also for every ‘i’, SPECIAL_SUM(i) can be calculated as:

SPECIAL_SUM(i) = FIRST_SUM(i) + LAST_SUM(i)

Your task is to return the minimum SPECIAL_SUM for 0 <= i <= N - 1.

For example:

Given ‘N’ = 4 and ‘ARR’ = [1, 2, 3, 4].
Then the minimum special sum will be 5 for i = 0 (0-based indexing), which is (1 + 4) = 5.Sum of 1 integer from beginning and end.
For i = 1 it will be (1 + 2) + (3 + 4) = 10
For i = 2 it will be (1 + 2 + 3) + (2 + 3 + 4) = 15
For i = 3 it will be (1 + 2 + 3 + 4) + (1 + 2 + 3 + 4) = 20
All of which are greater than 5.  

1. Which Data Structure is best, Linked List or Array, and why? (Learn)
2. Comparison of Time complexity of insertion, deletion, and searching in an array and linked list. (Learn)
3. SQL Query counts the total number of employees in a table. (Learn)
4. What is Normalization? Explain 1NF, 2NF, 3NF, and BCNF. (Learn)
5. Explain OOPS. Give real-life examples of Abstraction. (Learn)

Four people are trying to cross a sketchy rope bridge in the middle of the night. Only two can cross at a time. They only have one flashlight, and so one person must bring it back across the bridge to the starting side before anyone else can cross. One person takes 1 minute to cross, another takes 2 minutes to cross, another takes 5 minutes to cross, and the last person takes 10 minutes to cross. Hypothetically, if the 2-minute person and the 5-minute person crossed together, that would take a total of 5 minutes (but someone needs to bring the flashlight back, resulting in 7 minutes spent if the 2-minute person returns with the light). Everyone needs to get across in 17 minutes or less, otherwise they will be ripped apart and consumed by zombies.

Print the following pattern

Pattern for N = 4

The dots represent spaces.

Ninja is given a pattern. Now he is asked to print the same pattern for any given ‘N’ number of rows.

Note:

There is only one space between the values of each column in a row.

For example, Pattern for ‘N’ = 5 will be.
1 2 3 4 5 
11 12 13 14 15 
21 22 23 24 25 
16 17 18 19 20 
6 7 8 9 10 

You are given a N x M matrix of integers, return the spiral path of the matrix

Example Of Spiral Path

Introduce yourself, why do you want to join the company, what do you know about the company etc.