Interview Experience 124(Intern)

2018

Intern

"Round 1 : Online Coding round on CoCubes Q1) Given a String find the average value of the string. Average is caluated using the ASCII values of the characters of the string.

Q2) Given n find the no of binary strings of length n which does not contain consecutive 1's. Ex : n = 1 O/P = 2 (0 , 1) n = 2 O/P = 3 (00,10,01) n = 3 O/P = 5 (000,001,010,101,100) this problem is similar to finding the nth fibonacci number with fib(1) = 2 , fib(2) = 3

Q3) https://www.geeksforgeeks.org/delete-n-nodes-after-m-nodes-of-a-linked-list/

I solved all three questions and was selected for next round.

Round 2 : Group fly round Around 44 students were shortlisted for this round. This was basically a pen and paper round. We all were given a common question and 30 min time to code that on paper. Question : https://www.geeksforgeeks.org/sliding-window-maximum-maximum-of-all-subarrays-of-size-k/ I solved it using deque in O(n) time and was shortlisted for next round. Many candidates solved it using brute force in O(n*k) and were also shortlisted.

Round 3 : F2F interview 1 Around 22 people where shortlisted for this round. The interviewer was really very cool and asked me about my interests, strengths, weaknesses. Then he asked me to solve two problems. Problem : https://www.geeksforgeeks.org/dynamic-programming-set-18-partition-problem/ Problem : given a bst print it's values in ascending order. I solved both the problems. Then he asked me some OOPs questions like : 1)what is encapsulation? 2)what is inheritance? 3)Explain virtual functions. 3)Explain early binding and late binding. 4)what is copy constructor? I answered all the questions and was shortlisted for the next round.

Round 4 : F2F interview 2 Around 11 people where shortlisted for this round. The interviewer asked me if i knew Shortest path Algorithms. I replied with a yes. Then he asked me to code Dijkstra's algorithm and explain it's working. I wrote the code and expalined it using an example. He seemed satisfied.

Round 5 : HR round Around 9 people were selected for this round. The HR was really very cool. He asked me to tell him about myself. Then he asked me some questions.

1. Given a binary tree find the sum of all the nodes of that tree.
2. difference between structure and union.
3. difference between c and c++.
4. what is a view ?
5. what is normalization ?
6. explain polymorphism. He asked me why i hadn't done any projects/interns. Then we had a general talk about the company.

6 students were selected for the intership, i was one of them."