ZeMoSo Technologies Senior Developer Interview Questions and Answers

They asked some general Quantitative and logical questions and code snippets.

Q1. String Reverse and Two Sum
Add your answer
Q2. Related to my projects and Tech Stacks
Add your answer

Q1. This is the Second technical round. The interviewer asked about everything from my project.
Add your answer
Q2. Asked some sql queries like joins and set operation
Add your answer

Code Snept question with 3-4 Reasoning question. Google form

Pen paper coding round. String , Array . Linkedlist , graph, questions

Q1. Maximum Spaning
Add your answer
Q2. Nearest Prime number
Ans. 
To find the nearest prime number, iterate from the given number in both directions until a prime number is found.
• Start iterating from the given number in both directions to find the nearest prime number.

• Check if a number is prime by dividing it by all numbers less than its square root.

• Keep track of the closest prime number found during the iteration.
Answered by AI
Add your answer
Q3. Second Maximum Number in Array
Ans. 
Find the second maximum number in an array of strings.
• Convert the array of strings to an array of integers.

• Sort the array in descending order.

• Return the second element in the sorted array.
Answered by AI
Add your answer

Q1. Project Question
Add your answer
Q2. Robot question of DSA
Add your answer
Q3. Stock Buy and sell - VI . Leetcode Hard
Add your answer
Q4. Leetcode Medium
Add your answer

Q1. How make a queue using a stack
Ans. 
To implement a queue using a stack, use two stacks and simulate the queue operations.
• Use two stacks, one for enqueue operation and one for dequeue operation.

• For enqueue operation, simply push elements onto the stack used for enqueueing.

• For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.

• Then pop from the dequeue stack to simulate dequeue operation.
Answered by AI
Add your answer
Q2. Create a linked list
Ans. 
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
• Create a Node class with data and next pointer

• Initialize a head pointer to null

• Add nodes by updating next pointers

• Traverse the list by following next pointers
Answered by AI
Add your answer

First round 14 Java ,3 SQL ,3 apptitude

3 Java questions strings and Java

Q1. About the programming
Add your answer
Q2. Your coding questions
Add your answer

Q1. Self Intro about you
Ans. 
I am a passionate software developer with 5 years of experience in full-stack development.
• Experienced in Java, JavaScript, HTML, CSS, and SQL

• Strong problem-solving skills and ability to work in a team

• Developed a web application for a startup company using React and Node.js
Answered by AI
Add your answer
Q2. About your resume
Add your answer