Interview Experience 56

ONLINE ROUND-

1. 20 Mcqs on OS, DS,DBMS, NETWORKING (all were gate questions) Practice from geeksforgeeks

2. Add three linked lists

3. I don't remember :p

1ST TECHNICAL ROUND

1. Given a n*n matrix, swap the diagonals elements.

Eg: 1 2 3 4

   5 6 7 8

   9 10 11 12

  13 14 15 16

Output: 4 2 3 1

           5 7 6 8

           9 11 10 12

           16 14 15 13

2. Print the inorder traversal of a binary tree.

3. Multiply a number by 7 without using *,/,+,- operators.

2ND TECHNICAL ROUND

1. Check whether a tree is Valid BST or not.

2. Check for balanced parenthesis.

3. Print the vertical sum of a tree.

4. Questions on pointers and reference.

3RD TECHNICAL ROUND

1. what happens when you type URL in the browser. I was asked to explain the whole process diagrammatically.

2. Print left view of a binary tree.

4TH TECHNICAL ROUND

1. Given a BST with the nodes having parent pointers. You are given two nodes (pointers), return the path from node1 to node2.

2. Given a Linked list. Print the nth node from the end.

PS : In all the rounds, first they ask the approach and then we are required to code it.