Sandvine Softwaretest Engineer Interview Questions and Answers

There were 2 coding questions and 20 aptitude questions. Coding questiins were based in trees and graphs

Q1. Mainly dsa, oops questions were asked
Add your answer
Q2. Find cycle in linked list
Ans. 
Use Floyd's Tortoise and Hare algorithm to detect cycle in a linked list.
• Initialize two pointers, slow and fast, at the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps.

• If they meet at any point, there is a cycle in the linked list.

• If fast pointer reaches the end of the list, there is no cycle.
Answered by AI
Add your answer

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

Difficult online round

Q1. Arrays from neetcode
Ans. 
Arrays are a collection of strings in programming used to store multiple values under a single variable name.
• Arrays are declared using square brackets []

• Each element in an array is accessed by its index, starting from 0

• Example: var fruits = ['apple', 'banana', 'orange']
Answered by AI
Add your answer
Q2. Linked list from neetcode
Add your answer

Q1. Trees in neet code
Ans. 
Trees in neet code refer to the implementation of tree data structures in coding challenges on the platform NeetCode.
• Trees are a common data structure used in coding challenges to represent hierarchical relationships between data.

• Common tree operations include traversal (inorder, preorder, postorder), insertion, deletion, and searching.

• Examples of tree-related coding challenges on NeetCode include implementing a binary...read more
Answered by AI
Add your answer
Q2. Trees in leet code
Ans. 
Trees in leetcode are a common topic for coding interviews, involving various tree traversal and manipulation techniques.
• Understand different tree traversal methods like inorder, preorder, and postorder.

• Learn about common tree algorithms like finding the height, diameter, and lowest common ancestor.

• Practice solving tree-related problems on leetcode to improve your skills.
Answered by AI
Add your answer

Q1. Java basics , oops , spring
Add your answer

Q1. Manger round basics behavior
Add your answer

Q1. Find the min and max from List of Integers using java 8 streams.
Add your answer
Q2. Find 2nd largest element using java 8 streams from list of integers.
Add your answer
Q3. Given a Product class and some ArrayList data Find which products has price greater than 200 using java 8 streams?. Find which products having maximum price?
Add your answer
Q4. Increase a value of List of Integers by *2 and written new list.
Add your answer
Q5. What are the java new features?
Add your answer
Q6. @Components vs @Repository
Add your answer
Q7. @SpringBootApplication
Add your answer
Q8. @Entity explain?
Add your answer
Q9. How the database is configure?
Add your answer
Q10. What is Dockerfile?
Add your answer
Q11. Explain CI CD and your project deployment.
Add your answer
Q12. What is mutable classes in java? How to create?
Add your answer

Q1. Yet to sChedule
Add your answer

Q1. Ds implementation in python
Ans. 
Data structure implementation in Python
• Use built-in data structures like lists, dictionaries, sets, etc.

• Implement custom data structures like linked lists, stacks, queues, trees, etc.

• Utilize libraries like NumPy for efficient array operations

• Practice implementing algorithms using data structures
Answered by AI
Add your answer

Q1. Leetcode medium python question
Add your answer