Q4. find number of swaps to make an array "good array" . good array is an array in which A[2*i]=A[2*i+1] Testcase : 1. size=3 arr= 1 1 1 output : -1(odd number of elements) 2. size =4 arr= 2 1 2 1 output =1 ( swap index 2,3) 3. size=2 arr=1 2 output = -1 ( we can't make A[0] = A[1]
Write an optimized code to sort an array in ascending order
SDLC, Static/Dynamic linking, WAP for prime number etc
Difference between a process and a thread?
The difficulty level felt quite high for this role, and I wasn’t mentally prepared for such deep technical questions. 1. Implement Smart Pointer in C++. 2. Implement Singleton Design Pattern. 3. Implement Observer Design Pattern. 4. Write code for the Shortest Distance Between Two Points. 5. Explain different Types of Indexing in DBMS.
Write the Code for Binary tree and basic concepts of DSA and OOPS.
what is Normalization in DBMS?
Basic python questions and some project based questions
They asked about soring algorithms like merge sort and quick sort their time complexities and which one is beneficial. They asked to perform node deletion in BST, node insertion in circular LL. They also asked basic DBMS and OOPs questions
Huge coding questions where three to four kinds of input were given like always.
Viewing 801 - 810 interview questions