-
Notifications
You must be signed in to change notification settings - Fork 13
Interview Experience 18 (Intern)
sggarg edited this page Aug 13, 2017
·
1 revision
##Online coding round: Two questions were given and hackerrank's platform was used. One easy question and one tough question. Time allotted: 50 mins
##Interview Round 1 : This was divided into two parts:
###Technical
- Was asked which area was I comfortable in. Being a CSE student(unlike in IT), OS and DBMS had not been taught to us, so i went ahead with Data Structures and OOP concepts.
- Questions started with the basic implementation of heaps like heapify operations,insertions,deletions,their time complexity etc.
- Tree traversals and their real life applications were asked, Concepts of dynamic programming and its application in a problem, a puzzle that I solved by BFS.
- OOP was given a lot of emphasis with virtual functions and run-time polymorphism being the favourite areas of the interviewers.
###HR round
- This one went real smooth(atleast it felt so)!
- My CV was examined and the rest of the time we talked about batman and anime and casual stuff. But please be careful, because you are constantly evaluated even though you may not feel that.
##Interview Round 2:
This was again a technical round.
- A few questions that I remember : Given the number of nodes how many binary trees can you construct.
- I solved it mathematically and when asked by them I had to solve it via a program using recursion.
- A question from Binary Search Tree(BST) went like : Given a sum and a BST find all pairs of nodes which give this sum.
- Gave the solution, and was asked to optimise.
- OOP questions focused on data abstraction and encapsulation, pointer manipulation, virtual functions(again!), Inheritance etc.
- The technical rounds were taken by two different panels each day.