Saankhya Labs Software Developer fresher Interview Questions and Answers

Q1. What is polymorphism
Ans. 
Polymorphism is the ability of a function or method to behave differently based on the object it is acting upon.
• Polymorphism allows objects of different classes to be treated as objects of a common superclass.

• It enables a single interface to be used for different data types or classes.

• Examples include method overloading and method overriding in object-oriented programming.
Answered by AI
Add your answer
Q2. Find missing number from nth number array.
Ans. 
Find missing number from nth number array.
• Iterate through the array and calculate the sum of all numbers

• Calculate the sum of numbers from 1 to n using the formula n*(n+1)/2

• Subtract the sum of array from the sum of numbers from 1 to n to find the missing number
Answered by AI
Add your answer
Q3. Explain inheritance and it types
Ans. 
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
• Inheritance allows a class to reuse code from another class.

• Types of inheritance include single inheritance, where a class inherits from only one parent class, and multiple inheritance, where a class inherits from multiple parent classes.

• Example: Class B inherits from Class A, so Class B can access
Answered by AI
Add your answer
Q4. Find 2nd max elements from aaray
Ans. 
Find 2nd max element from array of strings
• Sort the array in descending order

• Skip the first element (max element)

• Return the second element
Answered by AI
Add your answer

Total 60 question 30 from C/C++ output and 30 from profit-loss, find age and related to ratio

Q1. Dsa coding question, aptitude, oops, rdbms(joins and normalization)
Add your answer
Q2. Rotate materix(nxn) 90 degree
Ans. 
To rotate a matrix 90 degrees, transpose the matrix and then reverse each row.
• Transpose the matrix by swapping matrix[i][j] with matrix[j][i]

• Reverse each row of the transposed matrix to get the final rotated matrix
Answered by AI
Add your answer
Q3. A pattern printing question
Add your answer
Q4. Reverse doubli-linkedlist
Add your answer
Q5. Preorder traversal without using recursion
Ans. 
Iterative solution to perform preorder traversal without using recursion
• Use a stack to keep track of nodes

• Start by pushing the root node onto the stack

• While the stack is not empty, pop a node, visit it, then push its right child followed by its left child onto the stack
Answered by AI
Add your answer

Q1. Introduce yourself
Add your answer
Q2. Why you chose b.tech
Add your answer
Q3. Why you chose cse
Add your answer

3 basic DSA questions were asked from the topics binary trees, strings. The test was for 1 hour.

Q1. 2 easy DSA questions were asked on linked list and queue.
Add your answer

Q1. 2nd interview round was a managerial. I was asked questions about my projects. The interviewer asked me to write 2 simple SQL queries.
Add your answer

Q1. General questions about the company were asked.
Add your answer