Test:

• 15-20 MCQs (OOPs, OS, DBMS, Time complexity, classes)
• Write a program to check whether given string of parenthesis is balanced or not.
  INPUT:
  2
  {[]}()
  [[[]]()OUTPUT:
  YES
  NO
• Write a code to rotate a two dimensional matrix clockwise by 90^o INPUT:
  3 3
  1 2 3 4
  5 6 7 8
  9 10 11 12
  13 14 15 16
  OUTPUT:
  13 9 5 1
  14 10 6 2
  15 11 7 3
  16 12 8 4

Interview:

ROUND #1:

• Resume based questions.
• Write a code to print leaf nodes from left to right.
• Do you know what is BST, Design in BST and insert a new element in it.
• AVL tree rotations.
• Rearrange a string so that all the same characters are at d distance apart from each other and return -1 if not possible (Note: more than one possible answers).
  INPUT:
  2
  abbac 2
  abbbcd 3OUTPUT:
  ababc
  -1

ROUND #2:

• Write a program to find the minimum absolute difference between the elements of array taking one number from array1 and another from array2.INPUT:
  2
  5 6
  1 2 3 5 6
  0 4 0 7 8 9
  3 3
  1 2 3
  4 5 1
  
  
  
  

  OUTPUT:
  1
  0
  Afterwards, he increased the size of the array to 10^100 and sorting was not allowed
  HINT: Range of integer is fixed and 10^9 is very small as compared to input 10^100

• What are processes and threads?

ROUND #3:

• What are the processes? What are threads? How they are different from each other?
• What is a deadlock? Design one deadlock?
• Write a program to reverse a stack without using an auxiliary stack.