ZeMoSo Technologies Software Developer Intern Interview Questions, Process, and Tips for Freshers

Round duration - 45 minutes
Round difficulty - Medium

Online coding round.
We could only write pseudo code and couldn't test against test cases.

Q1. 
Binary Tree Level Order Traversal
You are given a binary tree of integers. Your task is to return the level order traversal of the given tree.
Input:
The first line contains an integer 'T', representing...read more
Ans. 
Return the level order traversal of a binary tree given in level order.
• Use a queue to perform level order traversal of the binary tree

• Start by pushing the root node into the queue

• While the queue is not empty, dequeue a node, print its value, and enqueue its children
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

It was onsite face to face technical round where i was asked 2 coding questions.
It lasted for 40-50 minutes.

Q1. 
Kth Ancestor in a Binary Tree
You are given an arbitrary binary tree consisting of N nodes numbered from 1 to N, an integer K, and a node TARGET_NODE_VAL from the tree. Your task is to find the Kth ancest...read more
Ans. 
Find the Kth ancestor of a given node in a binary tree.
• Traverse the tree to find the path from the target node to the root node.

• Store the path in a list and return the Kth element from the end.

• Handle cases where the Kth ancestor does not exist by returning -1.
Answered by AI
Add your answer
Q2. 
Equilibrium Indices in a Sequence
You are given an array/list named 'SEQUENCE', which consists of 'N' integers. The task is to identify all equilibrium indices in this sequence.
Explanation:
An equilibr...read more
Ans. 
Identify equilibrium indices in a given sequence by finding positions where sum of elements before and after is equal.
• Iterate through the sequence and calculate prefix sum and suffix sum at each index

• Compare prefix sum and suffix sum to find equilibrium indices

• Handle edge cases where no equilibrium index exists

• Return the indices as a sequence of integers or an empty sequence
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

Only 7 students were shortlisted after the first face to face round out of 40 students.
The interviewer seemed cool and was trying to calm down me as i was getting nervous.
Again there were 2 coding questions.

Q1. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. 
Reverse a singly linked list of integers and return the head of the reversed linked list.
• Iterate through the linked list and reverse the pointers to reverse the list

• Use three pointers to keep track of current, previous, and next nodes

• Update the head of the reversed linked list once the reversal is complete
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This was the last technical round and there were only 5 students left at the end of day.
The interview started at around 6:30 in the evening.

Q1. 
Replace with Sum of Greater Nodes Problem Statement
Convert a given binary search tree (BST) with 'N' nodes into a Greater Tree. In the Greater Tree, each node's data should be updated to the sum of its o...read more
Ans. 
Convert a binary search tree into a Greater Tree by updating each node's data to the sum of its original data plus the data of all nodes with greater or equal values.
• Traverse the BST in reverse inorder (right, root, left) to update nodes with the sum of greater nodes.

• Keep track of the sum of greater nodes encountered so far while traversing.

• Update each node's data with the sum of greater nodes and continue traversal.
Answered by AI
Add your answer
Q2. 
Nuts and Bolts Problem
You are given a collection of 'N' nuts and 'N' bolts, each having unique sizes. Your objective is to match each nut with its corresponding bolt based on size, adhering to a one-to-o...read more
Ans. 
Matching nuts and bolts based on size in a one-to-one mapping strategy.
• Iterate through the nuts and bolts arrays to find matching pairs based on size.

• Use sorting algorithms like quicksort to efficiently match nuts and bolts.

• Ensure the implementation modifies the input arrays directly to reflect the proper matched order.
Answered by AI
Add your answer