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. Outer And Inner Loop
We are going to have two loops outer-loop and inner-loop 
1. Maintain a count of the number of nodes visited in outer-loop.
2. For every node of the outer-loop, start the inner loop from head.
3. If the inner-loop visits the node next to the outer-loop node, then return true, else repeat the process for the next iteration of outer-loop.
4. If outer-loop reaches the end of list or null, then return false.
Space ...read more
Answered Anonymously
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. Merge Sort
We will use the ‘Merge Sort’ algorithm to sort the given linked list. Merge Sort is a Divide and Conquer algorithm. In this algorithm, we will divide the list into two parts, recursively sort the two parts and finally merge them such that the resultant list will be sorted.
 
Algorithm:
 
1. If the list contains only one node, return the head of the list.
2. Else, divide the list into two sublists. For this, we...read more
Answered Anonymously
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. Brute Force
• Create another matrix ‘TRANSPOSE’ of the same size initially having all zeros.
• Now replace ‘TRANSPOSE’ (i,j) with ‘MATRIX’ (j,i).
• And now traverse both matrixes element by element if anywhere there is inequality return false, else continue.
• In the end, return true as you traverse.
Space Complexity: O(1)Explanation:
 O(N ^ 2), Where ‘N’ is the size of the square matrix.
 
Since an extra matrix of size ‘N’...read more
Answered Anonymously
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. Spiral Matrix
Divide the matrix into loops. Print all the elements in the clockwise order from the first-outer layer, followed by the elements from the second outer layer, and so on. Use four loops to print all the elements. Every ‘for’ loop defines a single direction movement along with the matrix. The first loop represents the movement from left to right, the second loop represents the movement from top to bottom, the...read more
Answered Anonymously
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. Queue Solution
• The first element of the Level order Traversal is necessarily the root of the binary tree.
• The nodes which appear left of the root in the inorder traversal are necessarily in the left subtree, and those which appear in the right are in the right subtree of the right subtree.
• We can make use of the fact that the nodes of a subtree of the binary tree will form a continuous segment in the inorder array.
• We can ...read more
Answered Anonymously
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