Associate Software Developer

You are given two arrays 'A' and 'B' of size 'N' and 'M' respectively. Both these arrays are sorted in non-decreasing order. You have to find the intersection of these two arrays.

Intersection of two arrays is an array that consists of all the common elements occurring in both arrays.

Note :

1. The length of each array is greater than zero.
2. Both the arrays are sorted in non-decreasing order.
3. The output should be in the order of elements that occur in the original arrays.
4. If there is no intersection present then return an empty array.

You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.

Note:

We cannot use the element at a given index twice.

Follow Up:

Try to do this problem in O(N) time complexity. 

There were questions related to the roles and responsibilities of the projects done in the last organisation.
Basic Javascript questions based on Hoisting and closures.
Basic OOPS Concepts such as Abstraction, Encapsulation and Polymorphism. (Learn)
What is API integration? (Learn)

You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.

For example:

 If the given string is: STR = "abcde". You have to print the string "edcba".

follow up:

Try to solve the problem in O(1) space complexity. 

Difference between let, var and const. (Learn)

Why do you want to join Antino?

Will you be able to travel from Delhi to Gurugram daily?

What are your three weaknesses and Strengths?

What is your expected CTC?

Do you have any other offer? If yes, will you join Antino?