AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
ZeMoSo Technologies
Compare
Filter interviews by
ZeMoSo Technologies Software Developer Intern Interview Questions, Process, and Tips
Top ZeMoSo Technologies Software Developer Intern Interview Questions and Answers
- 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 t ...read more
- Q2. 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. I ...read more
- Q3. Least common ancestors tree
ZeMoSo Technologies Software Developer Intern Interview Experiences
2 interviews found
Selected
I was interviewed before Feb 2023.
(5 Questions)
- Q1. Oops implementation
- 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
- 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;
- Q4. Node implementation
- Q5. Sql query aasics
Interview Preparation Tips
Skills evaluated in this interview
I was interviewed in Nov 2021.
(1 Question)
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
ARRof sizeN, your objective is to determine the sum of the largest and smallest elements within the array.Follow Up:
Can you achie...
- Ans.
First I initialized two variables max and min.
and traverse the array to find max and min.
then return the sum of max and min.
(1 Question)
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... - Ans. Array Approach - Separate Chaining
Approach:
HashMap is the data structure used to store key-value pairs, where the average retrieval time for get() and insert() operations is constant i.e. O(1).
Hashmap uses the array of Singly Linked List internally.
The array is called the buckets and at every bucket(i-th index of the array) holds a pointer to head of the Singly Linked List.
Every Linked List Node has f...
Interview Preparation Tips
Tip 1 : Prepare OOPS Concepts
Tip 2 : Build good knowledge in Data Structure and Algorithms.
Tip 3 : Practice SQL queries.
Tip 1 : Do not put false things on resume
Tip 2 : Mention atleast 2 projects.
Skills evaluated in this interview
Interview questions from similar companies
Software Developer Intern Interview Questions & Answers
Josh Technology Group
Anonymous
posted on 4 Oct 2023
I applied via campus placement at Lovely Professional University (LPU) and was interviewed in Sep 2023. There were 4 interview rounds.
It was aptitude + oops concpets mcqs
This round had 3 dsa questions (tree, linked list, array) and 1 output based answer(bst)
This was another coding round of higher difficulty (linked list, tree)
Interview Preparation Tips
Software Developer Intern Interview Questions & Answers
Raja Software Labs
Anonymous
posted on 16 Sep 2021
I was interviewed before Sep 2020.
(4 Questions)
Round duration - 90 minutes
Round difficulty - Medium
They share doc file link which consist of 5 programming questions
- Q1.
Reverse Words in a String: Problem Statement
You are given a string of length
N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o... - Ans. Brute force
- Create a String ans to store the reversed string.
- Initialize a variable i to 0 and iterate the whole string through a while loop.
- Skip initial spaces by just incrementing i.
- Create a String that will store the current word.
- Add the currentword and space at the beginning of ans.
- After traversing the whole string, check if the length of ans is greater than 0 then return ans after removing the last space otherwise r...
- Q2.
Fibonacci Membership Check
Given an integer
N, determine if it is a member of the Fibonacci series. Returntrueif the number is a member of the Fibonacci series, otherwise returnfalse.Fibonacci Series...
- Ans. Space Complexity: Explanation: Time Complexity: Explanation:
- Q3.
Maximum Difference Problem Statement
Given an array
ARRofNelements, your task is to find the maximum difference between any two elements inARR.If the maximum difference is even, print EVEN; if it is...
- Ans. Find Max And Min
We will iterate over ARR and find the MAX and MIN of the ARR. And if the MAX - MIN is odd the return “ODD” else return "EVEN".
The algorithm will be-
- MAX = -1, MIN= 10 ^ 9 + 1
- For VAL in ARR.
- If MAX < VAL
- MAX = VAL
- If MIN > VAL
- MIN = VAL
- If MAX < VAL
- IF (MAX-MIN) % 2
- Return ODD
- ELSE
- Return EVEN
O(1).
Since constant space is used.
Time Complexity: O(n)Explanation:O(N), where N ...
- Q4.
Remainder When Divided By 11 Problem Statement
Determine the remainder when a given number, 'N' in the form of a string, is divided by 11.
Input:
The first line contains an integer 'T' denoting the numb... - Ans. Using Modulo Property
- Since the number is very large we can not simply calculate N % 11.
- Now, any number say 256 % 11 can be calculated as (25*10 + 6)%11. Which in turn can be calculated as (( 25*10)%11+ 6)%11 or ( (25%11)*10 + 6)%11. Similarly 25%11 can be calculated as (2*10+5)%11. Therefore , 256 %11 can be finally calculated as ( ( (2*10 + 5)%11 )*10 + 6)%11.
- So, the idea is to store the number N in string Str.
- Take a ...
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
In this round interviewer asked me to solve 3 programming questions.
- Q1.
Selection Sort Algorithm
Selection sort is a sorting technique that works by repeatedly finding the minimum element (considering ascending order) from the unsorted part and placing it at the beginning of ...
- Ans. Selection Sort Approach
Selection sort is a standard sorting algorithm that uses nested loops to find all the minimum elements in the array in each iteration and swap them with the starting element of the unsorted region of the array.
Steps :
- Use a minValue variable to find the index of the minimum element of the array.
- Use a loop to iterate over all the elements of the array.
- Use a nested loop to find the minimum ele...
- Q2.
String Palindrome Verification
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
Input:
The input is a single string without any leading or trailing... - Ans. Space Complexity: Explanation: Time Complexity: Explanation:
- Q3.
Star Pattern Problem Statement
Display the star pattern for a given positive integer N.
Example:
Input:
N = 4
Output:
*
***
*****
*******
Explanation:
The dots in the image represent spaces. Al...
- Ans. Space Complexity: Explanation: Time Complexity: Explanation:
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
This was the HR round. They asked me simple HR questions and 1 coding question.
- Q1.
Character Counting Challenge
Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...
- Ans. Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Interview Preparation Tips
Tip 1 : Learn how to optimize the program. This will really help you during RSL interview.
Tip 2 : Study all previously asked question by this company and try to find out best solution for it.
Tip 3 : Keep resume simple and authenticated.
Tip 4 : Practice how to handrun the program.
Tip 1 : Resume should be authenticated. You should be able to answer all things on resume.
Tip 2 : Keep it simple.
Tip 3 : Having internship experience will help.
Skills evaluated in this interview
Software Developer Intern Interview Questions & Answers
Josh Technology Group
Anonymous
posted on 18 Oct 2023
I applied via Campus Placement and was interviewed in Apr 2023. There were 2 interview rounds.
Aptitude test consisted of around 45 MCQs from basic topics like C, C++, OOPS
2nd round had 3 medium level (Leetcode) questions and 1 output question: 1. Level order traversal, 2. count zeros(not sure), 3. Linked List traversal related.
Interview Preparation Tips
Software Developer Intern Interview Questions & Answers
Josh Technology Group
Anonymous
posted on 19 May 2022
I was interviewed in Aug 2021.
(2 Questions)
Round duration - 75 minutes
Round difficulty - Medium
Round held at 12 noon. There were 2 interviewers
- Q1.
Zig-Zag Array Rearrangement
You are provided with an array of distinct elements, and your task is to rearrange the array elements in a zig-zag manner. Specifically, for every odd index
i, the elementARR[... - Q2.
Sum Root to Leaf Path Problem
You are given an arbitrary binary tree consisting of
Nnodes where each node is associated with an integer value from 1 to 9. Each root-to-leaf path in the tree represents a ...
(2 Questions)
Round duration - 120 minutes
Round difficulty - Easy
Round held at 4pm. There were 2 interviewers
- Q1.
Reverse Linked List in Groups of K
You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...
- Q2.
Nodes at Distance K from a Given Node
Given an arbitrary binary tree, a specified node within the tree, and an integer 'K', find all nodes that are exactly 'K' distance away from the specified node. Retur...
Interview Preparation Tips
Tip 1 : For every topic of DSA do at least 30 question so that you get good grasp on each topic
Tip 2 : Must go through OOPS, DBMS in details as they are very much asked in interview
Tip 3 : Also you should have complete knowledge of the technology used in your personal projects.
Tip 1 : Your resume must be of 1 page only
Tip 2 : You must have projects in your resume along with the practical impact it is making
Skills evaluated in this interview
Software Developer Intern Interview Questions & Answers
Josh Technology Group
Anonymous
posted on 1 Jun 2022
I was interviewed before Jun 2021.
Round duration - 50 minutes
Round difficulty - Medium
It was an online objective round held at 10:00AM. The platform had proctoring enabled for tab switches, refreshes, etc.
(1 Question)
Round duration - 75 minutes
Round difficulty - Easy
This round was help at 2pm after the first round. Each round had elimination. Only those who cleared a round were allowed in the next round. This was also a proctored round. It had question on arrays and linked list.
- Q1.
Reverse Linked List in K-Groups
Given a linked list consisting of 'N' nodes and an integer 'K', reverse the linked list in groups of size K. Specifically, reverse the nodes in each group starting from (1,...
(2 Questions)
Round duration - 45 minutes
Round difficulty - Easy
It was a technical interview round. It was held in the morning. We had to keep our camera on as it was video proctored. The interviewer did not turned on their camera. Initially I was asked for an introduction in which I told about myself and my projects and internships.
The interviewer gave me 2 coding problem. Although I was able to solve them easily, the interviewer seemed to be ready to help if stuck. The interviewer asked for extensive dry run on both the problems.
- Q1.
Merge Two Binary Trees Problem Statement
You are given the roots of two binary trees,
root1androot2. Merge these two trees into a new binary tree. If two nodes overlap, sum the node values as the new no... - Q2.
Covid Vaccination Distribution Problem
As the Government ramps up vaccination drives to combat the second wave of Covid-19, you are tasked with helping plan an effective vaccination schedule. Your goal is...
(2 Questions)
Round duration - 50 minutes
Round difficulty - Medium
It was a technical interview round. It was held in the morning. We had to keep our camera on as it was video proctored. The interviewer did not turned on their camera. Initially I was asked for an introduction in which I told about myself and my projects and internships. He also cross questioned on my projects.
The interviewer gave me 2 coding problem.. The interviewer gave hints whenever I got stuck.
- Q1.
Find Nodes at Distance K in a Binary Tree
Your task is to find all nodes that are exactly a distance K from a given node in an arbitrary binary tree. The distance is defined as the number of edges between ...
- Q2.
Divide Chocolates Problem Statement
Ninja bought chocolate consisting of several chunks, and the sweetness of each chunk is represented in an array
ARR. He wants to divide the chocolate intoK + 1parts (...
Round duration - 25 Minutes
Round difficulty - Easy
Interview Preparation Tips
Tip 1 : Practice up to the level to able to solve medium level questions.
Tip 2 : Question might get focused on Trees, Linked List and Arrays in the initial rounds.
Tip 3 : If you are going to tell about your projects, make sure to you know what you have done and if done in a team what you have contributed individually.
Tip 4 : During round 3 or HR interviews make sure to highlight your soft skills like communication and leadership by relating to real life project if possible.
Tip 1 : Have at least two projects in you resume and mention what you achieved.
Tip 2 : Write about your role and responsibilities if mentioning any internships.
Tip 3 : Also mention extra curriculars if any to highlight soft skills.
Skills evaluated in this interview
Software Developer Intern Interview Questions & Answers
Josh Technology Group
Anonymous
posted on 16 Sep 2021
I was interviewed in Feb 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Timing was late. Environment was good.
- Q1.
Dijkstra's Shortest Path Problem
Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...
- Ans. Using Adjacency Matrix
The idea is to maintain two arrays, one stores the visited nodes, and the other array stores the distance (element at index ‘i’ denotes the distance from node 0 to node ‘i’). We pick an unvisited minimum distance vertex, then update the distance of all its adjacent vertices considering the path from source to an adjacent vertex to pass through the picked minimum distance vertex. Repeat the process...
- Q2.
Spiral Matrix Path Problem Statement
Given a N x M matrix of integers, print the spiral order of the matrix.
Input:
The input starts with an integer 'T' representing the number of test cases. Each test ...
- Ans. Recursive
For each boundary, we will use the 4 loops. Now the problem is reduced to print the remaining submatrix which is handled with the help of recursion. Keep track of new dimensions(rows and columns) of the current submatrix which are passed with the help of parameters in each recursion call.
Algorithm:
spiralPrint(matrix[][], startingRow, startingCol, endingRow, endingCol):
- Check for base cases, i.e. if ...
- Q3.
0/1 Knapsack Problem Statement
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
- Ans. Dynamic Programming
Approach: In the Dynamic programming we will work considering the same cases as mentioned in the recursive approach. In a DP[][] table let’s consider all the possible weights from ‘1’ to ‘W’ as the columns and weights that can be kept as the rows.
The state DP[i][j] will denote maximum value of ‘j-weight’ considering all values from ‘1 to ith’. So if we consider ‘wi’ (weight in ‘ith’ row) we can...
Interview Preparation Tips
Tip 1 : Practice Data Structures and algorithms.
Tip 2 : Do 2 projects.
Tip 3 : Practice mcq too.
Tip 1 : Do not put false things on resume.
Tip 2 : Keep it short.
Skills evaluated in this interview
Software Developer Intern Interview Questions & Answers
Josh Technology Group
Anonymous
posted on 16 Sep 2021
I was interviewed in Jan 2021.
(2 Questions)
Round duration - 75 minutes
Round difficulty - Medium
It was a coding round.
- Q1.
Multiply Linked Lists Problem Statement
Your task is to multiply two numbers represented as linked lists and return the resultant multiplied linked list.
Explanation:
The multiplied list should be a lin...
- Q2.
Binary Tree Diameter Problem Statement
Given a binary tree, determine the length of its diameter. The diameter is defined as the longest path between any two end nodes in the tree. The path's length is re...
(3 Questions)
Round duration - 70 mintues
Round difficulty - Medium
It was an online coding round.
- Q1.
Add Two Numbers Represented by Linked Lists
Your task is to find the sum list of two numbers represented by linked lists and return the head of the sum list.
Explanation:
The sum list should be a linked...
- Q2.
Buy and Sell Stock Problem Statement
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...
- Q3.
Is Height Balanced Binary Tree Problem Statement
Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:
- The left subtree is balanced.
- The right subtree is bala...
(3 Questions)
Round duration - 90 minutes
Round difficulty - Medium
In this round, three questions were asked and all of them were based on DSA.
- Q1.
Sum Root to Leaf Numbers
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
- Q2.
Maximum Non-Adjacent Subsequence Sum
Given an array of integers, determine the maximum sum of a subsequence without choosing adjacent elements in the original array.
Input:
The first line consists of an...
- Q3.
Rearrange Linked List Problem Statement
Given a singly linked list in the form 'L1' -> 'L2' -> 'L3' -> ... 'Ln', your task is to rearrange the nodes to the form 'L1' -> 'Ln' -> 'L2' -> '...
(3 Questions)
Round duration - 120 minutes
Round difficulty - Medium
In this round, three questions were asked and all of them were based on DSA and a little bit about projects.
- Q1.
Minimum Jumps Problem Statement
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...
- Q2.
N Queens Problem
Given an integer
N, find all possible placements ofNqueens on anN x Nchessboard such that no two queens threaten each other.Explanation:
A queen can attack another queen if they ar...
- Q3.
Flatten Binary Tree to Linked List
Transform a binary tree with integer values into a linked list by ensuring the linked list's nodes follow the pre-order traversal order of the binary tree.
Explanation:
...
Round duration - 20 mintues
Round difficulty - Easy
It was on the next day of the last technical round, I was on the same site as the technical interview round.
Interview Preparation Tips
Tip 1 : Be strong at your basics.
Tip 2 : Brush up fundamental concepts deeply
Tip 3 : Do at least 2 projects and ask to find answers like why are you choosing this tech stack? why did not you choose its alternatives Know your project in and out because they might ask you for a modification in your project?
Tip 1 : Have some projects on your resume.
Tip 2 : Do not put false things on your resume.
Tip 3 : Try to keep a single-page resume.
Skills evaluated in this interview
Software Developer Intern Interview Questions & Answers
Josh Technology Group
Anonymous
posted on 15 Sep 2021
I was interviewed in Feb 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Timing was late. Environment was good.
- Q1.
Dijkstra's Shortest Path Problem Statement
You are given an undirected graph with
Vvertices (numbered from 0 to V-1) andEedges. Each edge connects two nodesuandvand has an associated weight represe... - Q2.
Spiral Matrix Problem Statement
Given a two-dimensional matrix of integers, print the matrix in a spiral order.
Input:
The first line contains an integer 't' indicating the number of test cases. For eac... - Q3.
0/1 Knapsack Problem Statement
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Interview Preparation Tips
Tip 1 : Practice Data Structures and algorithms.
Tip 2 : Do 2 projects.
Tip 3 : Practice mcq too.
Tip 1 : Do not put false things on resume.
Tip 2 : Keep it short.
Skills evaluated in this interview
ZeMoSo Technologies Interview FAQs
Tell us how to improve this page.
ZeMoSo Technologies Interviews By Designations
- ZeMoSo Technologies Senior Software Engineer Interview Questions
- ZeMoSo Technologies Software Engineer Interview Questions
- ZeMoSo Technologies Senior Software Engineer 2 Interview Questions
- ZeMoSo Technologies Node JS Developer Interview Questions
- ZeMoSo Technologies Senior Software Engineer 1 Interview Questions
- ZeMoSo Technologies Software Engineer III Interview Questions
- ZeMoSo Technologies Associate Software Engineer Interview Questions
- ZeMoSo Technologies Principal Software Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Developer Interview Questions
- Software Development Engineer Interview Questions
- Junior Software Developer Interview Questions
- Show more
ZeMoSo Technologies Software Developer Intern Interview Process
based on 1 interview
Interview experience
Software Developer Intern Interview Questions from Similar Companies
Fast track your campus placements
ZeMoSo Technologies Software Developer Intern Reviews and Ratings
based on 3 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
- Home >
- Interviews >
- ZeMoSo Technologies Interview Questions >
- ZeMoSo Technologies Software Developer Intern Interview Questions
