Technical Analyst-Intern

Ninja has been given an array/list ‘ARR’ of unknown size and an element ‘TARGET.’ The ‘ARR’ is sorted in ascending order and all the elements of the ‘ARR’ are different. However, the size of the array is unknown to you. So Ninja can only access the 'ARR' using an interface ‘readValueAtIndex’. If you are trying to access a value from the index not present in the ‘ARR,’ you get output ‘10 ^ 9 + 7’.Ninja has to find that the position of the element ‘TARGET’ if it is present in the ‘ARR’.

For example:

Let ‘ARR’ = {2 4 7 10}.

If you want to know that what is the value at the 0-index in ‘ARR’, use ‘readValueAtIndex(0)’. Then the output is 2.

Let’s assume that you are trying to get the value at the 10’th index so, use ‘readValueAtIndex(10)’. Then the output is ‘10 ^ 9 + 7’. Because you are trying to access an index that is greater than the size of ‘ARR’.

Note: If the element ‘TARGET’ is not present in the ‘ARR’ then return -1.

Recently Ninja has been learning about a new Ninja Technique to cross a field with landmines. The field is in the form of a rectangular matrix of size M x N, having few landmines, which are placed arbitrarily. The landmine gets triggered if a person is any closer than one cell from the position where it is placed. So Ninja must avoid the landmines and any of the four adjacent cells (left, right, above and below), as they are also unsafe.

Initially Ninja is on one side of the field and has to move to the other side. You need to help Ninja apply the new Ninja Technique by providing him with the length of the shortest safe route possible from any cell in the first column to any cell in the last column of the field.

Note that Ninja is only allowed to move only in the direction left, right, above and below i.e., he cannot move diagonally to the next cell.

Note :

The length of the path is the number of steps required to reach from the first column of the field to the last column i.e., one less than the number of cells in the path.

For Example :

Consider the field of size 4*4, shown below. The cells containing landmine are marked with 0 and red colour. The cells near the landmine which are unsafe are marked with a light red colour. 

The shortest safe route for Ninja, starting from any cell in the first column to any cell in the last column of the field is marked with green colour. The length of the path is 3.

You are given an array/list ARR consisting of N integers. Your task is to find the maximum possible sum of a non-empty subarray(contagious) of this array.

Note: 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 of array D.

For e.g.- All the non-empty subarrays of array [1,2,3] are [1], [2], [3], [1,2], [2,3], [1,2,3].

You are given two non-negative numbers 'num1' and 'num2' represented in the form of linked lists.

The digits in the linked lists are stored in reverse order, i.e. starting from least significant digit (LSD) to the most significant digit (MSD), and each of their nodes contains a single digit.

Calculate the sum of the two numbers and return the head of the sum list.

Example :

Input:
'num1' : 1 -> 2 -> 3 -> NULL
'num2' : 4 -> 5 -> 6 -> NULL

Output: 5 -> 7 -> 9 -> NULL

Explanation: 'num1' represents the number 321 and 'num2' represents 654. Their sum is 975.

Difference between Union and Union all

Two tables were present having similar schema containing some common and distinct data I had to write a query to return a table containing all the entries all both tables but there should be distinct entries in the resulting table.

Given an employee table get all the names starting with the letter a.

You are given a positive integer ‘N’. Your task is to print all prime numbers less than or equal to N.

Note: A prime number is a natural number that is divisible only by 1 and itself. Example - 2, 3, 17, etc.

You can assume that the value of N will always be greater than 1. So, the answer will always exist.

He asked me the main features of Angular because I have written angular in the skills section of my resume.

I don't remember this question precisely but it was somewhat like this:
Two tables were given and he asked me the employee names which were most common in each city.
The tables were like this:
Table 1:employee_id name office_id 
Table 2:Office_id city
This is just an idea of how the question was. The original question was a bit tougher than this because I remember that I had a hard time solving that question but i solved it in not more than 5-7 minutes.

You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.

A cycle occurs when a node's next points back to a previous node in the list.

Example:

In the given linked list, there is a cycle, hence we return true.

You must implement the Stack data structure using a Singly Linked List.

Create a class named 'Stack' which supports the following operations(all in O(1) time):

getSize: Returns an integer. Gets the current size of the stack

isEmpty: Returns a boolean. Gets whether the stack is empty

push: Returns nothing. Accepts an integer. Puts that integer at the top of the stack

pop: Returns nothing. Removes the top element of the stack. It does nothing if the stack is empty.

getTop: Returns an integer. Gets the top element of the stack. Returns -1 if the stack is empty

The interviewer asked me to design a banking system in which the user can use either the current account(rate of interest 10%) or savings account(rate of interest 7%) and the functions that I had to implement were:
1 Withdraw
2 deposit
He asked me to implement this using Object Oriented Concepts.

You have been given an integer array/list(ARR) of size N. Where N is equal to [2M + 1].

Now, in the given array/list, 'M' numbers are present twice and one number is present only once.

You need to find and return that number which is unique in the array/list.

 Note:

Unique element is always present in the array/list according to the given condition.

Suppose you have a 3 liter jug and a 5 liter jug (this could also be in gallons). The jugs have no measurement lines on them either. How could you measure exactly 4 liter using only those jugs and as much extra water as you need?

Are you a team player?

What happens if your team is not working as expected?

Who is your role model?

What keeps you motivated?