ZeMoSo Technologies Associate Software Engineer Interview Questions, Process, and Tips

Given a list of integer find the longest increase sequence

Q1. Given a list of integer find the first non repeating integer using stream API of Java 8.
Ans. 
Find the first non-repeating integer in a list using Java 8 stream API.
• Use Java 8 stream API to group integers by count

• Filter out integers with count greater than 1

• Return the first non-repeating integer
Answered by AI
Add your answer
Q2. Questions on core java like how internationally string works, hashmap etc And questions on database like what is indexing How to optimize SQL queries etc
Add your answer

Q1. Given a Map of fruits with there price as a key value pair respectively, find the fruit whose price is maximum using Java 8 Stream API.
Ans. 
Using Java 8 Stream API to find the fruit with maximum price in a Map of fruits.
• Use entrySet() method to get a stream of key-value pairs from the Map.

• Use max() method with Comparator.comparing() to find the entry with maximum price.

• Extract the key (fruit) from the entry with maximum price.
Answered by AI
Add your answer
Q2. Write a program to check whether the parenthesis are properly balanced or not, means for every opening brace these should be a closing brace present.
Ans. 
Program to check if parenthesis are properly balanced
• Use a stack data structure to keep track of opening parenthesis

• Iterate through the input string and push opening parenthesis onto the stack

• When a closing parenthesis is encountered, pop from the stack and check if it matches the corresponding opening parenthesis

• If stack is empty at the end and all parenthesis are matched, then the input has properly balanced parenthe
Answered by AI
Add your answer
Q3. Questions on core Java, Spring Boot, JPA, and Microservices you should have strong foundation in these topics questions asked like 1) what is API gateway 2) how 2 services communicate with eachother 3) ...read more
Add your answer

Q1. Easy question on arrays
Add your answer
Q2. Easy question on arrays and trees
Add your answer

Simple aptitude questions, quantitative and qualitative questions

1 medium coding question. Preferably write in Java. Add commands to explain your code along with time and space complexity

Q1. Interview round where ask about general DSA questions, SQL along with practical questions.
Add your answer
Q2. A variant of bubble sort
Ans. 
Cocktail sort is a variant of bubble sort that sorts in both directions.
• Also known as bidirectional bubble sort or shaker sort.

• It starts with the first element and compares it with the next one, swapping if necessary.

• Then it moves to the last element and compares it with the previous one, swapping if necessary.

• It continues until no more swaps are needed.

• It is more efficient than bubble sort for large lists with many ou
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

It was virtual 1st round with aptitude and computer science related questions and the other was the programming question for which they were given 30 min to solve and available languages are C,C++,Java and Python.

Q1. 
Ninja and Alternating Largest Problem Statement
Ninja is given a sequence of numbers and needs to rearrange them so that every second element is greater than its neighbors on both sides.
Example:
Input:
...read more
Ans. 
The task is to rearrange the given array such that every second element is greater than its left and right element.
• Read the number of test cases

• For each test case, read the number of elements in the array and the array elements

• Iterate through the array and swap elements at odd indices with their adjacent elements if necessary

• Check if the rearranged array satisfies the conditions and print 1 if it does, else print 0
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was around 1PM when this round started. It was taken by 2 developers working in the company. Initially I was a bit nervous but both ther interviewers are flexible. It went well with some discussions and questions.

Q1. 
Longest Common Prefix After Rotation
You are given two strings 'A' and 'B'. While string 'A' is constant, you may apply any number of left shift operations to string 'B'.
Explanation:
Your task is to calcu...read more
Ans. 
The question asks to find the minimum number of left shift operations required to obtain the longest common prefix of two given strings.
• Perform left shift operations on string B to find the longest common prefix with string A

• Count the number of left shift operations required to obtain the longest common prefix

• Return the minimum number of left shift operations for each test case
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This was the final and technical round. It happened in between 7-7.30 pm. This interview was taken by senior member in the company.

Q1. 
Sub Sort Problem Statement
You are given an integer array ARR. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in a...read more
Ans. 
The question asks to find the length of the shortest contiguous subarray that needs to be sorted in order to sort the whole array.
• Iterate through the array and find the first element that is out of order from the left side.

• Iterate through the array and find the first element that is out of order from the right side.

• Find the minimum and maximum element within the subarray from the above steps.

• Expand the subarray from bo...read more
Answered by AI
Add your answer