Sandvine Software Development Engineer Interview Questions and Answers

Hacker rank, 3 questions with 1 hour duration

Q1. Stack parenthesis matching
Add your answer
Q2. Linked List reversal
Add your answer

Q1. Operating System basics
Add your answer
Q2. Behavorial questions
Add your answer
Q3. Networking Basics
Add your answer

Q1. Data structure algorithm questions related to various scenarios
Add your answer
Q2. DS Algo related questions which revolved around different scenarios
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. 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