Symphony Talent Software Developer Interview Questions, Process, and Tips

Round duration - 105 minutes
Round difficulty - Medium

Yes, here comes the technical Round. Like other casual Interviews, it started with my introduction. and then the Interviewer asked me about OOPs Concepts and for every concept he asked for an example code. it took around 20 mins for this round and next he started asking questions from my project ( in which I mentioned ML Project ). From this he has asked Like why do you choose this algorithm and why did you learned ML. After That he moved to the problem solving part. He asked 6 questions on Problem solving. this took me around 30 mins to solve. I'll mention those problems in the below section. And he started asking me about tree's implementation. I answered him the theoretical part for the questions asked. and furtherly he asked me 6-7 SQL queries which took me around 20mins I remember. And from there he started asking questions about CN and OS. As I don't know about them- I replied Like i didn't have much Knowledge In these Sessions but I have Learned Some new technologies that are trending in the market. So, the key point for every Interview is like- we need not to be know everything it is up to us to in which area we are having interest and finally you should be able to show that you are expert in that and one more thing- Any job role is not expecting to be good at only one area of tech- So you should be able to convince the Interviewer that you are capable of understanding, learning new tech and to be have good team working skills.

Q1. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.
• Use Floyd's Tortoise and Hare algorithm to detect a cycle in O(N) time complexity and O(1) space complexity.

• Start with two pointers, slow and fast, moving at different speeds. If they meet at some point, there is a cycle.

• If the fast pointer reaches the end of the list (null), there is no cycle.

• Check if the n...read more
Answered by AI
Add your answer
Q2. 
Merge Sort Linked List Problem Statement
You are given a singly linked list of integers. Your task is to sort the linked list using the merge sort algorithm.
Explanation:
Merge Sort is a divide and conq...read more
Ans. 
Implement merge sort algorithm to sort a singly linked list of integers.
• Divide the linked list into two halves using slow and fast pointers.

• Recursively sort the two halves.

• Merge the sorted halves using a merge function.

• Handle the base case of empty or single node list.

• Ensure the termination of the linked list with -1 at the end.

• Example: For input 3 1 2 -1, output should be 1 2 3 -1.
Answered by AI
Add your answer
Q3. 
Matrix Symmetry Check Problem Statement
You are provided with a square matrix. Your task is to determine if the matrix is symmetric. Return true if it is symmetric, otherwise return false.
A matrix is co...read more
Ans. 
Determine if a square matrix is symmetric by checking if its transpose is equal to itself.
• Iterate through the matrix and compare each element with its corresponding element in the transpose

• If any pair of elements are not equal, return false immediately

• If all pairs are equal, return true at the end
Answered by AI
Add your answer
Q4. 
Spiral Matrix Problem Statement
You are given a N x M matrix of integers. Your task is to return the spiral path of the matrix elements.
Input
The first line contains an integer 'T' which denotes the nu...read more
Ans. 
The task is to return the spiral path of elements in a given matrix.
• Iterate through the matrix in a spiral path by adjusting the boundaries at each step.

• Keep track of the direction of traversal (right, down, left, up) to cover all elements.

• Handle edge cases like when the matrix is a single row or column.

• Implement a function that takes the matrix dimensions and elements as input and returns the spiral path.
Answered by AI
Add your answer
Q5. 
Height of Binary Tree
You are provided with the Inorder and Level Order traversals of a Binary Tree composed of integers. Your goal is to determine the height of this Binary Tree without actually construc...read more
Ans. 
Find the height of a Binary Tree given its Inorder and Level Order traversals without constructing it.
• Use the properties of Inorder and Level Order traversals to determine the height of the Binary Tree.

• The height of a Binary Tree is the number of edges on the longest path from the root to a leaf node.

• Consider edge cases like a single node tree or empty tree while calculating the height.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

In this round Company Director for India team and HR has joined.
I started with my Introduction and he has asked what I know about the Company. I started saying everything from google and Wikipedia and from their official site. As this is a off campus recruitment he started explaining about the company what they do and the job role I have applied for. He said that the job was very challenging one and we'll be closely dealing with clients and meeting their expectations is quite challenging for the role. and then he started asking some real HR questions. for which I have answered in a cool way