SDE - 1

Ninja is bored with his previous game of numbers, so now he is playing with divisors.

He is given 'N' numbers, and his task is to return the sum of all numbers which is divisible by 2 or 3.

Let the number given to him be - 1, 2, 3, 5, 6. As 2, 3, and 6 is divisible by either 2 or 3 we return 2 + 3 + 6 = 11.

Ninja has been given a binary string ‘STR’ containing either ‘0’ or ‘1’. A binary string is called beautiful if it contains alternating 0s and 1s.

For Example:‘0101’, ‘1010’, ‘101’, ‘010’ are beautiful strings.

He wants to make ‘STR’ beautiful by performing some operations on it. In one operation, Ninja can convert ‘0’ into ‘1’ or vice versa.

Your task is to determine the minimum number of operations Ninja should perform to make ‘STR’ beautiful.

For Example :

Minimum operations to make ‘STR’ ‘0010’ beautiful is ‘1’. In one operation, we can convert ‘0’ at index ‘0’ (0-based indexing) to ‘1’. The ‘STR’ now becomes ‘1010’ which is a beautiful string. 

You have two strings “A” and “B”. Your task is to print these two strings in an alternative fashion according to indices i.e. first character of “A”, the first character of “B”, the second character of “A”, the second character of “B” and so on.

Note:

If all characters of one string are printed and some characters of other string are remaining, then you have to print the remaining characters of the other string at the end of the resulting string.

Follow Up :

Can you solve the problem in O(N) time complexity and O(1) space complexity?

For Example:

A = “abc” B = “fdh” then answer will be afbdch.

Have you worked on Linux OS?

Tell me some commands in Linux. Which commands are used to create a file and write in it? (Learn)

If we want to print top 10 lines from a file which command will we use? 

If we want to print last 10 line of file which command will we use? 

Which command is used to get ip address of pc? . 

What is the difference between physical address and logical address? (Learn)
If we are given a file with 1000 lines and we want to print lines from 600-700 which command will we use?
What is Process and process scheduling? (Learn)

What is deadlock?  (Learn)

What are necessary conditions for deadlock? (Learn)

He asked me about my topic of interest.
I said OOPS ,
He asked me what is class and object, relation between class and object. (Learn)
What is Inheritance and types of Inheritance. along with example of inheritance. (Learn)
What are access specifier in OOPS? (Learn)
What is default access specifier of class?
What is the difference between class and structure? (Learn)
What is garbage collection? (Learn)
Different storage mediums in C++.
What is copy constructor? (Learn)

1) You are at the side of a river. You are given a 3-litre jug and a 5-litre jug. Both the jugs are initially empty. The jugs don’t have markings to allow measuring smaller quantities. You have to use the jugs to measure 4 litres of water. Determine the minimum no of operations to be performed to obtain 4 litres of water in one of the jugs.

2) You have a birthday cake and have to cut it into 8 equal pieces by making 3 cuts only. How do you do it?

1) If we toss 1 coin three times one by one then what will the probability of getting heads all the time.
2) How you will implement this through coding?

You are given an array consisting of 'N' integers. You have to find the fourth largest element present in the array.

If there is no such number present in the array, then print the minimum value of an integer which is -2147483648.

Follow Up:

Try solving this problem in O(N) time complexity.

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

The above illustrates shows how merge sort works.

Note :

It is compulsory to use the ‘Merge Sort’ algorithm.

You are given an array of integers. You need to sort the array in ascending order using quick sort.

Quick sort is a divide and conquer algorithm in which we choose a pivot point and partition the array into two parts i.e, left and right. The left part contains the numbers smaller than the pivot element and the right part contains the numbers larger than the pivot element. Then we recursively sort the left and right parts of the array.

Example:

Let the array = [ 4, 2, 1, 5, 3 ]
Let pivot to be the rightmost number.

After the 1st level partitioning the array will be { 2, 1, 3, 4, 5 } as 3 was the pivot. After 2nd level partitioning the array will be { 1, 2, 3, 4, 5 } as 1 was the pivot for the left part and 5 was the pivot for the right part. Now our array is sorted and there is no need to divide it again.

Given a singly linked list of integers. Your task is to return the head of the reversed linked list.

For example:

The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.

Follow Up :

Can you solve this problem in O(N) time and O(1) space complexity?

Given a singly linked list, you have to detect the loop and remove the loop from the linked list, if present. You have to make changes in the given linked list itself and return the updated linked list.

Expected Complexity: Try doing it in O(n) time complexity and O(1) space complexity. Here, n is the number of nodes in the linked list.

Ninja is given an integer ‘N’. Ninja wants to find whether the binary representation of integer ‘N’ is palindrome or not.

A palindrome is a sequence of characters that reads the same backward as forward.

Ninja is busy with his training. Help Ninja in finding out whether the binary representation of ‘N’ is palindrome or not.

We are given a sorted doubly-linked list which contains distinct positive integers, and an integer ‘X’. Print all such unique pairs from the given list so that their sum is equal to ‘X’.

What is normalization?
What is BCNF?
Types of languages in DBMS
What is DML, DQL ,DDL? Which commands comes under each?
Write a query to find distinct records from a table
Write a query to find duplicate records from a table
You are given two tables Student and Subject with fields student_id , name , class , subject_id , marks and subject id , subject name . How you get the average marks of student subject wise?

1) Why are the you best fit for this role?
2) Is this your first interview?
3) What are your strengths and weaknesses?
4) if you have given interviews previously for other companies why have you not been selected? What have you missed?