ZeMoSo Technologies Interview Questions, Process, and Tips

2 questions - one was a basic DP question

Q1. Streams Question
Add your answer
Q2. Questions related to Java
Add your answer
Q3. Height of the binary tree
Ans. 
Height of a binary tree is the maximum number of edges on the longest path from the root node to a leaf node.
• The height of an empty tree is -1.

• The height of a tree with only one node is 0.

• The height of a binary tree can be calculated recursively by finding the height of the left and right subtrees and adding 1 to the maximum of the two heights.
Answered by AI
Add your answer
Q4. Minimum spanning tree
Add your answer

Q1. Sort 0 and 1
Ans. 
Sort an array of 0s and 1s in linear time complexity.
• Use two pointers approach - one from the start and one from the end of the array.

• Swap 0s to the left side and 1s to the right side until the pointers meet.

• Time complexity: O(n), Space complexity: O(1)
Answered by AI
Add your answer
Q2. Implement LRU cache
Ans. 
LRU cache is a data structure that stores the most recently used items, discarding the least recently used items when full.
• Use a combination of a doubly linked list and a hashmap to efficiently implement LRU cache.

• Keep track of the most recently used item at the head of the linked list and the least recently used item at the tail.

• When a new item is accessed, move it to the head of the linked list and update the hashmap...read more
Answered by AI
Add your answer

Q1. Questions related to Java, Spring, DSA
Add your answer
Q2. Find the number of consecutive alphabets in a string.
Ans. 
The question asks to find the number of consecutive alphabets in a string.
• Iterate through the string and check if each character is consecutive to the previous one.

• Keep track of the count of consecutive alphabets encountered.

• Return the count at the end.
Answered by AI
Add your answer

Q1. Questions related to Java, Spring, SonarCube, Unit test, SQL index, API Gateway
Add your answer

Q1. Mostly CTC discussion
Add your answer

2 programming questions on Java 8 and 2 logical reasoning questions.

Q1. Find longest palindromic substring in a string, basic java and springboot questions.
Add your answer

Q1. Print all the pairs of anagram present in a list of string, questions on java and Springboot, details of the project you have worked upon.
Add your answer

3 questions, 1 group the anagram in the given string , 2. Generate the Fibonacci series 3. Sort the string based on length.

Q1. Java memory management for heap and stack, what is the use of string pool, java 8 features, multi threading sample program, explain one design pattern with example
Ans. 
Java memory management, string pool, Java 8 features, multi threading, design patterns
• Java memory management involves managing memory allocation for heap and stack. Heap is used for storing objects and is managed by garbage collector. Stack is used for method calls and local variables.

• String pool is a special area in heap memory where String literals are stored to optimize memory usage. Strings with same values are sto...read more
Answered by AI
Add your answer
Q2. Why spring framework, app concept, spring security jwt, design food ordering api
Add your answer
Q3. How SQL index works internally, SQL execution order
Ans. 
SQL indexes are data structures that improve the speed of data retrieval operations by providing quick access to rows in a table.
• SQL indexes are created on columns in a table to speed up SELECT queries.

• When a query is executed, the SQL engine first checks if there is an index on the columns involved in the query.

• If an index is present, the SQL engine uses it to quickly locate the rows that satisfy the query conditions.

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

Q1. Questions related to js es6
Add your answer
Q2. Questions related to string rotation
Add your answer

First round was a coding round on coderbyte