Interview Experience 169 (Intern)

2019

Software Development Engineer Intern

"Round 1:(Online Round )

• 7 debugging questions(normal codes)

*25 Reasoning questions

*2 coding ques:

1. Question was on this Concept

   https://www.geeksforgeeks.org/search-in-row-wise-and-column-wise-sorted-matrix/

2. CPU Scheduling based question (Round Robin)

Round 2:(Technical,F2F)

1. Given a string ,I had to shorten it.

   eg input-: aaaaaabbbbccddddd

   output -: a6b4c2d5

   if you do regular contests then this question seems very  easy for you.
   But without going directly to the most optimized solution o(n) ,o(1);
   i had given first o(n)o(n) solution and implemented the solution using 
   unordered map.We had a short discussion on unordered map .After that  
   interviewer asked me to optimize my Solution then i do so.
   

_ Tip: Have your concepts clear about whatever DS you are going to use _ _and do not jump to most optimized solution rather start from the naive one _ _Discuss with the interviewer and then optimize your solution further _ _because interviewer wants to examine your thought process and thinking _ skills moreover a healthy interaction matters in interview.

2. Ages of persons are given.

   sort it.(Quite easier again)

   i answered we can use here mergesort or quicksort. Again we had Some discussion on mergesort and quick sort. like their complexities(worst,average,best),which will be better in which scenario,where quicksort goes for o(n^2) and why.

   After that he asked that if i could optimize.

   I answerd that we have to use extra Space for that and Using Counting sort.

   Hint : the maximum age of a person can be 150(rarely) or less.

3. What happens in the backend when you click a URL.

4. Theoretical questions related to OOP's.

   (Encapsulation,Inheritance,Polymorphism.Why ? Give a real life example how it can be so useful )

NOTE :mention Time and space complexity of all codes.

"