SDE - Intern

You have been given a Binary Tree of integers, find the minimum depth of this Binary Tree. The minimum depth of a Binary Tree is the number of nodes along the shortest path from the root node down to the nearest leaf node.

Note:

A leaf is a node with no children.

For example:

For the given binary tree

Output: 2
The shortest path is from root node 1 to leaf node 2 which contains 2 nodes in the path. Hence, the minimum depth is 2.

You are given a string ‘str’. You need to find out whether the string is a K-Palindrome or not.

A string is called a K-Palindrome if, after removing at most ‘k’ characters from the string, it can be Transformed into a Palindrome.

For Example :

str = “ababba”, k = 3.

In this example, If we remove one ‘b’ from the 3rd position, then the final string will be “ababa” which is a palindrome.

Hence the answer will be True. 

You have been given an array 'ARR' of 'N' distinct elements.

Your task is to find the minimum no. of swaps required to sort the array.

For example:

For the given input array [4, 3, 2, 1], the minimum no. of swaps required to sort the array is 2, i.e. swap index 0 with 3 and 1 with 2 to form the sorted array [1, 2, 3, 4].

Interviewer asked me to pick up a project from my resume and briefly give the explanation of what I did and how I implemented
Questions in this round are largely dependent on what the project is. I had an Operating Systems scheduler project and was asked questions along these line:
1. What was the motivation to pickup this project
2. What alternative solutions were considered instead of thi 
3. What are the drawbacks of the proposed solution?
4. What are the real world applications for this

Mukesh is a hard worker and has a good running business. He has a list of profits he made in the last ‘N’ days. Mukesh wants to know what maximum profit he made in the few consecutive days. More Precisely he wants to know the maximum profit he made in any consecutive days in the range {‘A’, ‘B’} ( both inclusive).

You have to find the maximum profit Mukesh made in any consecutive days in the range {‘A’, ‘B’} ( both inclusive).

Note :

The profit of the Mukesh Business over ‘N’ days is shown by array/list ‘profit’. It may contain negative values as there will be a loss on those days.

Discussed about one of the IOT projects I had done.
Asked me what alternatives of the project had I considered. 
He discussed what challenged I faced and how did I overcome them
Interviewer also asked how the solution can further be improved. 
I was asked questions on what I know about trilogy and how would I be able to fit in the fast paced culture of Trilogy.
I was also asked what computer science courses I have studied till now and asked me to give short explanation of what I had learnt in each of them.