ZeMoSo Technologies Sdet Lead Interview Questions and Answers

Mostly sql based questions

It was modrate easy with compare to other

Good questions which is some are modrate and some difficult

It was basic dsa questions on hashmap and heap

De/algo leetcode medium level

Mostly sql based questions

Round duration - 90 minutes
Round difficulty - Easy

It was purely a coding round

Q1. 
Course Schedule Problem Statement
You are enrolled as a student and must complete N courses, numbered from 1 to N, to earn your degree.
Some courses have prerequisites, which means that to take course i,...read more
Add your answer
Q2. 
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Add your answer

Q1. What is an abstract class?
Ans. 
An abstract class is a class that cannot be instantiated and may contain abstract methods that must be implemented by its subclasses.
• Cannot be instantiated directly

• May contain abstract methods

• Used as a blueprint for other classes
Answered by AI
Add your answer
Q2. What is abstraction?
Ans. 
Abstraction is the process of hiding complex details and showing only the essential features of an object or system.
• Abstraction allows us to focus on what an object does, rather than how it does it

• It helps in simplifying complex systems by breaking them down into smaller, more manageable parts

• Examples of abstraction include using a car without needing to understand its internal combustion engine, or using a smartphone
Answered by AI
Add your answer
Q3. Best sorting algo?time complexity of it?
Ans. 
QuickSort is one of the best sorting algorithms with an average time complexity of O(n log n).
• QuickSort is a divide and conquer algorithm that works by selecting a 'pivot' element and partitioning the array around the pivot.

• It has an average time complexity of O(n log n) and a worst-case time complexity of O(n^2).

• Example: ['apple', 'banana', 'cherry', 'date', 'fig'] can be sorted using QuickSort.

• Example: ['3', '1', '4'...read more
Answered by AI
Add your answer
Q4. You have been provided a sorted list time complexity achieved after we apply bubble sorting
Ans. 
Bubble sorting has a time complexity of O(n^2) for a sorted list.
• Bubble sorting has a worst-case time complexity of O(n^2) for a sorted list.

• The time complexity does not change even if the list is already sorted.

• Example: If we have a sorted list of size n, bubble sorting will still take O(n^2) time.
Answered by AI
Add your answer

Q1. Have you ever been to a state other than jharkhand?
Ans. 
Yes, I have been to multiple states other than Jharkhand.
• I have traveled to states like Maharashtra, Karnataka, and Tamil Nadu for work and leisure.

• I have visited tourist destinations in states like Rajasthan, Kerala, and Himachal Pradesh.

• I have family in states like Uttar Pradesh, Bihar, and West Bengal, which I have visited multiple times.
Answered by AI
Add your answer

1 hour duration with basic level aptitude

1 hour 30 minutes, basic to medium level dsa