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

Q1. Oops implementation
Add your answer
Q2. Least common ancestors tree
Ans. 
Finding the least common ancestor of two nodes in a tree
• Use a method like Lowest Common Ancestor (LCA) to find the least common ancestor of two nodes in a tree

• Traverse the tree to find the paths from the root to each node, then compare the paths to find the LCA

• Consider edge cases like when one node is the ancestor of the other or when one of the nodes is not in the tree
Answered by AI
Add your answer
Q3. Structure in c++
Ans. 
Structure in C++ is a user-defined data type that allows grouping of variables of different data types under a single name.
• Structures are used to create complex data types by grouping variables together.

• They can contain variables of different data types.

• Structures are defined using the 'struct' keyword.

• Example: struct Person { string name; int age; };

• Example: Person p1;
Answered by AI
Add your answer
Q4. Node implementation
Add your answer
Q5. Sql query aasics
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

There were around 20 mcq's on Aptitude.
1 Coding Question

Q1. 
Sum of Maximum and Minimum Elements Problem Statement
Given an array ARR of size N, your objective is to determine the sum of the largest and smallest elements within the array.
Follow Up:
Can you achie...read more
Ans. 
Find sum of maximum and minimum elements in an array with least number of comparisons.
• Iterate through the array and compare elements in pairs to find maximum and minimum simultaneously.

• Keep track of current maximum and minimum as you iterate through the array.

• After iterating through the array, sum up the maximum and minimum found.

• Example: For input [1, 3, 5, 7, 9], compare 1 with 3, 5 with 7, and 3 with 9 to find min a...read more
Answered by AI
View 4 more answers

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Design a Constant Time Data Structure
Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:
1. INSERT(key, value): Add or update t...read more
Ans. 
Design a constant time data structure for key-value mappings with operations like INSERT, DELETE, SEARCH, GET, GET_SIZE, and IS_EMPTY.
• Use a hash table to store key-value pairs for constant time operations.

• Implement INSERT by hashing the key and storing the value at the corresponding index.

• For DELETE, simply remove the key-value pair from the hash table.

• SEARCH can be done by checking if the key exists in the hash table.

• ...read more
Answered by AI
Add your answer