Synopsis Interview Experience (On-Campus)

Technical Round 1

Coding questions

1. Given an array find the number having more than one occurrence and keep all of its occurrences at end of the array do not use any extra space and modify the given array only also the sequence of all other numbers should be same.
2. Test case – arr = [1,2,4,3,5,6,4,7,4] o/p – [1,2,3,5,6,7,4,4,4]
3. How does push back function works in stl?
4. How memory is allocated if we are using push back function?
5. How many functions we can create using n numbers of input.
6. What is difference between latch and flipflop
7. Explain mergesort algorithm and also write time complexity in Theta Notation.
8. What is hashmap. How does it works give a real life example where we can use unordered hashmap.
9. Some questions from your resume
10. Check tree is inverted BST or not,
11. Merge two linked list alternatively.

Technical Round 2

1. Two to three code snippet were given and i was asked to predict output(questions were a bit tricky).
2. Again a code were given and i was asked to predict output it was based on OOPS basically on inheritance order of constructor and destructor calling.
3. Write a recursive code to reverse a string do not create another string modify given string itself.
4. Write a code to find unique and non-unique elements in a string.(do not use map) and print all elements.
5. What is xor Write its truth table.
6. Write truth table of inverter using xor.
7. Given a graph write DFS and BFS traversal of a graph
8. Asked puzzle- Given a 3*3 cube all sides are painted with blue color if we cut it into 1*1 squares than how many numbers of little squares having No side painted, one side painted,two side painted and three side painted.
9. Difference between Function overloading and overriding.
10. Check two tree is mirror of each other or not.
11. Swap the adjacency bits of the number.
12. What is Flipflop and Explain D flipflop.
13. Create OR gate using 2*1 MUX.