Software Developer

There were 25 aptitude questions and 15 questions from DSA, DBMS.

Number Of MCQs - 40

Ninja has been given an array/list ‘ARR’ of even size ‘N’ and an integer ‘K’. Ninja gives his friend a task to divide the given ‘ARR’ into ‘N’/2 pairs such that the sum of each pair should be divisible by ‘K’.

Can you help Ninja to do this task?

For Example :

If ‘ARR’ = [4 5 6 5 7 3] and ‘K’ = 5
Pairs are(4, 6), (5, 5) ,and (7, 3) and the sum of elements of each pair is divisible by ‘K’ i.e 5.

You have been given two strings, 'str1' and 'str2'.

Your task is to return true if the given two strings are isomorphic to each other, else return false.

Note :

Two strings are isomorphic if a one-to-one mapping is possible for every character of the first string ‘str1’ to every character of the second string ‘str2’ while preserving the order of the characters.

All occurrences of every character in the first string ‘str1’ should map to the same character in the second string, ‘str2’.

For example :

If str1 = “aab” and str2 = “xxy” then the output will be 1. ‘a’ maps to ‘x’ and ‘b’ maps to ‘y’.

If str1 = “aab” and str2 = “xyz” then the output will be 0. There are two different characters in 'str1', while there are three different characters in 'str2'. So there won't be one to one mapping between 'str1' and 'str2'.

Explain function overloading and function overriding.
Explain abstract class and abstract functions.

Introduce yourself.

What is your strength and weakness?

What do you know about the company?