ZeMoSo Technologies Sdet Automation Test Engineer Interview Questions and Answers

De/algo leetcode medium level

Mostly sql based questions

It was modrate easy with compare to other

Good questions which is some are modrate and some difficult

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
Ans. DFS Approach
The key observation here is that we need to consider the number of courses as vertices of a graph and prerequisites as directed edges of a graph.
 
Now the problem boils down to find if a cycle exists in the directed graph or not. If a cycle exists, no topological ordering exists and therefore it is impossible to take all courses.
 
Now, there is a cycle in the graph only if there is a back edge prese...read more
Answered Anonymously
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
Ans. Backtracking
1. Instead of checking all the places on the chessboard, we can use backtracking and place queen row-wise or column-wise.
2. Suppose we place queens row-wise, and we start with the very first row. Place the queen and move to the next row until either there is a solution or there are no viable cells left.
3. As we backtrack, check to place the queen in the different columns of the same row.
4. When we can place a queen at ...read more
Answered Anonymously
Add your answer

1 hour duration with basic level aptitude

1 hour 30 minutes, basic to medium level dsa

It was basic dsa questions on hashmap and heap