i
ZeMoSo Technologies
Filter interviews by
I applied via Referral and was interviewed in Aug 2024. There were 3 interview rounds.
Given a list of integer find the longest increase sequence
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
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.
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
I applied via LinkedIn and was interviewed in Sep 2022. There were 3 interview rounds.
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
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
What people are saying about ZeMoSo Technologies
I was interviewed in May 2021.
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.
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.
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
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.
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'.
Your task is to calcu...
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
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.
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...
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...
Tip 1 : Practise programming questions on daily basis.
Tip 2 : Do not jump into code directly. Brainstorm ideas and arrive at a soltuion.
Tip 3 : Learn OOPS along with real world scenarios and also dbms, os and cn.
Tip 1 : Keep it on a Page and Think like a employer when preparing resume.
Tip 2 : Your resume isn’t a list of everything you’ve ever done. Carefully curate the experiences that best capture your skills and problem-solving abilities.
Tip 3 : Include projects and highlight your achievements
ZeMoSo Technologies interview questions for designations
I was interviewed in Jan 2022.
Java OOPs concepts can be implemented using classes, objects, inheritance, polymorphism, and encapsulation.
Create classes with attributes and methods
Instantiate objects from classes
Use inheritance to create subclasses
Implement polymorphism through method overriding
Encapsulate data using access modifiers
Get interview-ready with Top ZeMoSo Technologies Interview Questions
posted on 16 Dec 2024
I applied via Campus Placement and was interviewed in Jun 2024. There were 4 interview rounds.
In the coding test, there were 2 problems based on arrays and hashing (easy to medium level leetcode)
I applied via campus placement at SRM university (SRMU) and was interviewed in May 2024. There were 5 interview rounds.
Assusual apti questions from every topics
1. 1 coding Question we can use java, python etc to solve and
2. another 1 sql question
One question based on any one data structure (in my case I solved stack &queue combinely)
I am strong in Java programming language.
Proficient in Java programming language
Experience in developing applications using Java
Knowledge of Java frameworks like Spring and Hibernate
I rate myself 4 out of 5 in IT skills.
Proficient in programming languages such as Java, Python, and C++
Experienced in software development and debugging
Familiar with database management systems like MySQL and MongoDB
The four pillars of OOP are encapsulation, inheritance, polymorphism, and abstraction.
Encapsulation: Bundling data and methods that operate on the data into a single unit.
Inheritance: Allows a class to inherit properties and behavior from another class.
Polymorphism: Ability to present the same interface for different data types.
Abstraction: Hides the complex implementation details and only shows the necessary features.
Print a specific pattern using loops
Use nested loops to print the desired pattern
Increment the number of characters printed in each row
Adjust the spacing to create the desired pattern
Static keyword is used in programming languages to declare variables, functions, or classes that are shared among all instances of a class or are only accessible within a specific scope.
Static variables retain their values between function calls
Static functions can only be called within the same file
Static classes cannot be instantiated and are used for grouping related methods and properties
posted on 9 Oct 2024
Easy applitute question with 1 coding question at the end
String builder is faster but not thread-safe, while string buffer is slower but thread-safe.
String builder is recommended for single-threaded applications for better performance.
String buffer is recommended for multi-threaded applications to ensure thread safety.
Example: StringBuilder sb = new StringBuilder(); StringBuffer sbf = new StringBuffer();
The final keyword in OOP is used to restrict the user from changing the value of a variable, overriding a method, or inheriting from a class.
Final variable: value cannot be changed once assigned
Final method: cannot be overridden in child classes
Final class: cannot be inherited by other classes
BSF graph explanation
BFS (Breadth-First Search) is a graph traversal algorithm that explores all the neighbor nodes at the present depth before moving on to the nodes at the next depth.
It uses a queue data structure to keep track of the nodes to visit next.
BFS is often used to find the shortest path in an unweighted graph.
Example: BFS can be used to find the shortest path in a maze from the starting point to the exit.
posted on 1 Aug 2024
I applied via campus placement at Jagan Institute of Management Studies (JIMS) and was interviewed in Jul 2024. There was 1 interview round.
posted on 4 Sep 2024
I applied via Naukri.com and was interviewed in Aug 2024. There were 2 interview rounds.
Basic aptitude question
Based on puzzle comprehension
Some of the top questions asked at the ZeMoSo Technologies Associate Software Engineer interview -
based on 3 interviews
Interview experience
based on 12 reviews
Rating in categories
Senior Software Engineer
74
salaries
| ₹12.7 L/yr - ₹33 L/yr |
Associate Software Engineer
45
salaries
| ₹6.5 L/yr - ₹7.3 L/yr |
Software Engineer
36
salaries
| ₹6 L/yr - ₹17 L/yr |
Software Engineer2
31
salaries
| ₹10 L/yr - ₹14 L/yr |
Senior Software Engineer 2
25
salaries
| ₹21.3 L/yr - ₹25 L/yr |
Persistent Systems
LTIMindtree
Mphasis
TCS