Skip to content

Interview Experience 148 (Intern)

Jump to bottom
pkkp86nitd edited this page Aug 28, 2019 · 1 revision

2019

Software Development

"Round 1:(Online Coding Round ,1.5 hrs) The online test was conducted on https://mettl.com/. There was 90 minutes to solve and code 3 Problems. The questions were based on basic Implementation Problems (Commonly found in CodeChef, Codeforces, geeksforgeeks and other online platforms). Among the three questions, two were easy and one was of mediocre difficulty. 66 students were selected for the next round.

Round 2:(Group Fly Round ,45 mins)

  • In this round, we all were given one question to solve within 45 minutes. We had to write functions on A4 paper (in any programming language or pseudocode) their Time and Space Complexity. We were advised to write as many solutions as possible for the problem but the most optimal solution would be considered.
  1. Given, an array of size ‘n’.The question was to shift all the zeros present in the array to the right of the array maintaining the order of non-zero elements.
    • a) Input: array : [0, 10, 7, 0, 0, 0, 8, 0, 3, 6] n: 10
    • b) Output: array : [10, 7, 8, 3, 6, 0, 0, 0, 0, 0] 42 students were selected for the next Round.

Round 3:(Technical Part 1 ,45 mins) The Interviewer asked questions about Concepts of Object-Oriented Programming, Data Structures and Algorithms.

  1. The Interviewer described some scenarios and asked how to tackle them with OOP concepts like Virtual Function, Multiple Inheritance, Operator Overriding etc.

  2. Given two strings P and Q, the question was to check if the two strings are a permutation of each other or not. Example: if string P: ‘aBca’ and string Q: ‘Baac’ then P and Q are permutations of each other.

  3. There are ‘n’ buildings in a row. A monkey can cross one or two buildings in one jump. In how many possible ways the monkey can reach from the first building to the last building? Example: For n = 4 the no. of ways would be 3 as the possible ways can be (1->2->3->4; 1->3->4; 1->2->4)

    For each question, I wrote C++ functions on paper and he asked me to explain the time and space complexity of my solutions and the possible corner cases. He also discussed other possible approaches to solve the problems.

Round 4:(Technical Part 2 ,30 mins) In this round, I was asked to solve some Real-life problems using DS and Algorithms Concepts and some puzzles.

  1. Given a hyperlink of a website Homepage, my task was to print all the ‘dead links’ present on that website. A list of links present in each webpage was also given for each page of the website. Then the interviewer asked to solve and explain some mathematical and logical puzzles.

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

  1. At first, the interviewer asked me to introduce myself and my journey from my school to NIT Durgapur.
  2. He went through my CV and asked about my project and skills.
  3. He asked me some logic based Questions.
  4. Then he asked me what I liked most in their Pre-Placement Talk and why I wanted to join the Company.

"

Clone this wiki locally