Skip to content

Interview Experience 4 (Intern)

Jump to bottom
sggarg edited this page Aug 13, 2017 · 1 revision

##1st Round: Online coding round with 20 multiple choice questions and 2 programming questions; hosted on hackerrank.

##2nd Round:

  • Started off with Queue, Implementation of Queue using tree.
  • Priority Queue, Implementation of Priority Queue using a Heap. Had to write down the entire code for the Heap.
  • During implementation of Heap, I used an array, but the interviewer asked about the allocation of memory.
  • Resulted in him asking me to implement a ArrayList [similar to a vector] in my method

##3rd round:

  • What is ACID?
  • Difference between process and thread.
  • What is graph?
  • 2 programming Questions:
    • Implement any one graph traversal
    • In a 2-d array(m*n) filled with 0 and 1, a person can travel only down or right. He can only travel to the cells having '1'. Find the number of ways to go from (0,0) to (m-1,n-1). The program should be implemented Recursively only, not iteratively.

Clone this wiki locally