MTS 1

You are given an array of positive integers. Find the GCD(Greatest Common Divisor) of a pair of elements such that it is maximum among all possible pairs. GCD(a, b) is the maximum number x such that both a and b are divisible by x.

For example: 
If the given array is {1, 5, 2, 3, 4}, the output will be 2 (which is GCD of 2 and 4, all other pairs have a GCD of 1)

Given a string, determine if it is a palindrome, considering only alphanumeric characters.

Palindrome

A palindrome is a word, number, phrase, or other sequences of characters which read the same backwards and forwards.

Example:

If the input string happens to be, "malayalam" then as we see that this word can be read the same as forward and backwards, it is said to be a valid palindrome.

The expected output for this example will print, 'true'.

From that being said, you are required to return a boolean value from the function that has been asked to implement.

• Self Introduction 
• Explain Oops 
I explained 
• Polymorphism , encapsulation, Data hiding , Abstraction, Overloading , Overriding
He asked all the concepts of OOPs which i was familiar of so I answered easily then he came to DSA

• Linked List and its types, Stack , queue and its types, deque and its types , Binary search trees, Heap
Definition of each data structure and practical application where they are used , I answered all of them easily then he came on DBMS 

• Normalization, 2NF , 3NF , BCNF , partial dependency , Transitive dependency , Joins and its types
Definition of each and everything i was familiar of the things so i answered quickly

These questions took around 15-20 minutes in theory question then he moved to coding problems

Ninja has been given two sorted integer arrays/lists ‘ARR1’ and ‘ARR2’ of size ‘M’ and ‘N’. Ninja has to merge these sorted arrays/lists into ‘ARR1’ as one sorted array. You may have to assume that ‘ARR1’ has a size equal to ‘M’ + ‘N’ such that ‘ARR1’ has enough space to add all the elements of ‘ARR2’ in ‘ARR1’.

For example:

‘ARR1’ = [3 6 9 0 0]
‘ARR2’ = [4 10]
After merging the ‘ARR1’ and ‘ARR2’ in ‘ARR1’. 
‘ARR1’ = [3 4 6 9 10]

Reverse the given string word-wise. The last word in the given string should come at 1st place, the last-second word at 2nd place, and so on. Individual words should remain as it is.

1. write a query to find the name which has at least three character 
2. He gave me to tables student and course and ordered me to apply primary key on student table and foreign key on course table

1. You have one 7L bucket , one 4 L bucket and infinite amount of water. You have to measure 6L water by using these 2 buckets you can empty bucket any number of times but can't use third container ?

I didn't get the logic so I honestly said... I don't know

2. A men fell into 30 m deep well, Daily he try to climb 4 m and fell down 3 m. How many days are required by men to come out of the well ?
I got the logic of this problem, The answer is 27 days. and it was correct

• Tell me something about yourself ?
• What do you know about hexaview technologies 
I replied both the answer quickly so he asked me to start with OOPs
• What is Abstraction in Object Oriented Programming and give real life example of it ?
I answered so he asked me few more important things about abstraction encapsulation and data hiding 
• What is Anti- Abstraction and give real life example of it ?
I didn't know answer of this question so I honestly said I don't have any idea 
• DBMS : 2NF , 3NF , Types of dependencies , properties of transaction 
Then he gave me a table and ordered me to normalize in 2NF , I was getting confusion so he helped me little bit . I was finally able to normalize the table 
• DSA : Binary search Tree , Queues and its types
In this round he asked me about graph also, like which algorithms are used for generating minimum spanning tree for graph .
I answered all the question quickly. then he gave me a query in sql 

• SQL : Write query for inner join 
I easily wrote the query.


Then he moved to coding problems

Given an integer N, print all the prime numbers that lie in the range 2 to N (both inclusive).

Print the prime numbers in different lines.

Ninja is studying sorting algorithms. He has studied all comparison-based sorting algorithms and now decided to learn sorting algorithms that do not require comparisons.

He was learning counting sort, but he is facing some problems. Can you help Ninja implement the counting sort?

For example:

You are given ‘ARR’ = {-2, 1, 2, -1, 0}. The sorted array will be {-2, -1, 0, 1, 2}.

He asked me about brief description of my project and which database I used . The main focus was on database because the interviewer wanted to know that i had worked on database or not ?
I briefly explained my project then he asked me few questions from my project like which technology or algorithm i used for building it how many modules are there in project

• Self Introduction 
• Why do you want to join Hexaview technologies

You are given an ‘M*N’ Matrix, You need to print all possible paths from its top left corner to the bottom right corner if given that you can either move right i.e from (i,j) to (i,j+1) or down i.e from (i, j) to (i+1, j).

For Example :

1 2 3
4 5 6

For the above 2*3 matrix , possible paths are (1 2 3 6) , (1 2 5 6) , (1 4 5 6).

Note :

You can return the paths in any order.

He asked me advance queries of SQL 

First he gave a table Student which contains name of the student , subject , marks of student in that subject , there was composite primary key name + subject. It means student name can be repeated because one student can be enrolled in multiple subjects . 

• Find total marks from the table 
I made it easily 
• calculate total marks of each student from all subject and display it on console 
I used the aggregate function and group by clause and made it easily 
• Then he said to me to print the name of student who failed in exams where passing marks should be 33% 
I thinked firstly then i wrote the query to get the name of student who failed, firstly i calculated marks then percentage and then I printed the name where percentage < 33.

• Then he asked me final question on this table which was very tough 
the question was to find topper in each and every subject, for example if there are subjects like hindi , english , mathematics then we have to print the name of topper in each subject 
I was not able to write the query, so i said no i am not getting me but the interviewer was very amazing and polite so he motivated me to build the logic like don't give up ...... think more 
Then i took 2-3 minutes to build the query and the answer was correct so he was impressed with me

Then he also asked me about my project and databases 
So i give brief introduction of my project and he asked me question on how i am fetching data

I am very efficient in C++, so he said to me that our company do not work on C++ will you switch over different technologies
I simply said Yes, and currently i am working on python

At last as usual Do you have any question for me ? 
So I asked one question 

Then he answered and he also explained me training procedure of the company. We talked around 4-5 minutes on these topics because the interviewer was quite impressed with me