Synoriq Software Developer Interview Questions and Answers for Freshers

Q1. How make a queue using a stack
Ans. 
To implement a queue using a stack, use two stacks and simulate the queue operations.
• Use two stacks, one for enqueue operation and one for dequeue operation.

• For enqueue operation, simply push elements onto the stack used for enqueueing.

• For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.

• Then pop from the dequeue stack to simulate dequeue operation.
Answered by AI
Add your answer
Q2. Create a linked list
Ans. 
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
• Create a Node class with data and next pointer

• Initialize a head pointer to null

• Add nodes by updating next pointers

• Traverse the list by following next pointers
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Students who qualified in first round gets link for this round, this round had 4 questions in total, out of which 1 was output based and 3 was DSA based.

Q1. Validate Binary Tree Nodes
You are given ‘N’ binary tree nodes numbered from 0 to N - 1 where node ‘i’ has two children LEFT_CHILD[i] and RIGHT_CODE[i]. Return ‘True’ if and only if all the given...read more
Ans. 
The task is to determine if the given binary tree nodes form exactly one valid binary tree.
• Check if there is only one root node (a node with no parent)

• Check if each node has at most one parent

• Check if there are no cycles in the tree

• Check if all nodes are connected and form a single tree
Answered by AI
View 2 more amswers

Round duration - 75 minutes
Round difficulty - Medium

This round was of 70-75 minutes and had 3 coding questions of easy to medium level. There was some restrictions like we cannot use built-in functions in both second and third subjective round.

Q1. Balanced Binary Tree
You are given an integer 'H'. Your task is to count and print the maximum number of balanced binary trees possible with height 'H'.
The balanced binary tree is one in...read more
Ans. 
The maximum number of balanced binary trees possible with a given height is to be counted and printed.
• A balanced binary tree is one in which the difference between the left and right subtree heights is less than or equal to 1.

• The number of balanced binary trees can be calculated using dynamic programming.

• The number of balanced binary trees with height 'H' can be obtained by summing the product of the number of balanced...read more
Answered by AI
View 3 more amswers

Round duration - 60 minutes
Round difficulty - Medium

This was face to face interview round of 60 minutes. It was mostly based on DSA, some questions was also asked related to my projects and DBMS. Interviewer was kind and good.

Q1. Sort an array in wave form
You have been given an unsorted array ‘ARR’.
Your task is to sort the array in such a way that the array looks like a wave array.
Example:
If the given sequence ‘ARR’ has ‘N’...read more
Ans. 
The task is to sort an array in a wave form, where each element is greater than or equal to its adjacent elements.
• Iterate through the array and swap adjacent elements if they do not follow the wave pattern

• Start from the second element and compare it with the previous element, swap if necessary

• Continue this process until the end of the array

• Repeat the process for the remaining elements

• Return the sorted wave array
Answered by AI
View 4 more amswers
Q2. Maximum Sum BST
You are given a Binary Tree ‘root’. The given Binary Tree may or may not be a Binary Search Tree(BST) itself. Your task is to find the maximum sum of node values of any subtree that is a Bi...read more
Ans. 
The task is to find the maximum sum of node values of any subtree that is a Binary Search Tree(BST).
• Traverse the binary tree in a bottom-up manner

• For each node, check if it forms a BST and calculate the sum of its subtree

• Keep track of the maximum sum encountered so far

• Return the maximum sum
Answered by AI
View 3 more amswers

Round duration - 135 minutes
Round difficulty - Hard

This was the final technical round, it was around 2.5 hours long and based on mostly DSA and little bit Projects, DBMS, OS. Josh mainly focus on DSA and on Tree Data Structure in interview.

Q1. Pair Sum in BST.
You are given a Binary Search Tree (BST) and a target value ‘K’. Your task is to check if there exist two unique elements in the given BST such that their sum is equal to the given target ...read more
Ans. 
The task is to check if there exist two unique elements in the given BST such that their sum is equal to the given target 'K'.
• Traverse the BST in-order and store the elements in a sorted array

• Use two pointers, one at the beginning and one at the end of the array

• Check if the sum of the elements at the two pointers is equal to the target 'K'

• If the sum is less than 'K', move the left pointer to the right

• If the sum is grea...read more
Answered by AI
View 5 more amswers
Q2. Print Nodes at Distance K From a Given Node
You are given an arbitrary binary tree, a node of the tree, and an integer 'K'. You need to find all such nodes which have a distance K from the given no...read more
Ans. 
The task is to find all nodes in a binary tree that are at a distance K from a given node.
• Implement a function that takes the binary tree, target node, and distance K as input.

• Use a depth-first search (DFS) algorithm to traverse the tree and find the nodes at distance K.

• Keep track of the distance from the current node to the target node while traversing.

• When the distance equals K, add the current node to the result lis...read more
Answered by AI
View 3 more amswers

Round duration - 20 minutes
Round difficulty - Easy

This was the simple 20 minutes round

Q1. Basic HR Questions
In this interviewer asked me about my family, residence and if I will have any issue in relocating to Gurgaon. After 30 minutes of this round they send me mail regarding my selection.
Ans. 
The candidate was asked about their family, residence, and willingness to relocate to Gurgaon.
• The interviewer wanted to know about the candidate's personal background and circumstances.

• The candidate's response may have influenced their selection.

• Examples of relevant information include family size, current residence location, and any potential challenges in relocating.

• The candidate's answer should demonstrate their fle
Answered by AI
Add your answer