Interview Experience 145 (Intern)

2019

Software Development

"Round 1:(Online Coding Round ,1.5 hrs)

• There is three question in this round

1. Given an array of strings .Select any two strings of array it is said to be same if we take two indices i and j of one string swap with only if i%2 and j%2 is same and if after swapping two strings are equal they said to be same else they said to be different. Return the number of distinct strings.
2. There are n students and k toffee .We have to distribute this k toffee between n students such that in first round 1,2,3,4,......,n-1,n toffees in second round 1st student should get n+1,n+2,n+3,......,n+n-1,2n,toffee they get we do until all toffees are distributed. Output the final array the number of toffee ith student is a[i].
3. Based on DP /BFS

Round 2:(Group Fly Round ,45 mins) In this section they provided one question and we have to write the solution on paper in decreasing order of time and space complexity.First write brute force solution then improve your solution and go to optimized approach and write code with its time and space complexity. We have to put all zero at the end of array maintaining the order of remaining element of array.

Round 3:(Technical Part 1 ,30 mins)

• Starting from the OOPS concepts ,inheritance in classes (base class,derived class ),virtual function ,abstract virtual function ,their implementation and use and how run time binding happen. Then they ask question from algorithm and data structure problem .

1. Tree(Return the node where the bst validation fails)
2. Find the number of triangle form from given 3 sides length we can use any side multiple number of times.
3. (Based on Probability ) Given the two empty boxes and two piles of infinite red and blue balls .How we fill these two empty boxes such that selection of red ball is maximum?

Round 4:(Technical Part 2 ,30 mins)

• First they ask give me your introduction after that they ask question based on tree

1. To find n-1 th maximum element from tree?
2. How we decide we have to apply dfs or bfs on the given tree/graph problem
3. Process the mechanism of stack in dfs?
4. What is difference between abstract base class and derived class?
5. Write a program for given a number n,and a digit r and we have to find the numbers from 1 to n which having r in it and return its count and array containing these numbers.
6. Then they ask question from your subject COA(Computer Organization and architecture): What happen when computer are starting and describe it process and memory management?

Round 5:(HR Round,20-30 mins)

• First they ask to give introduction
• Then question from my project
• Describe whatever have you done in your project and explain all the things
• Tell about Microsoft .Why do you want to join Microsoft?
• Also in each round they will give the chance if you have any question for
  him/her you feel free to ask whatever you are thinking at that time don't shy?

"