Quinbay Sdet Engineer Interview Questions and Answers

It was modrate easy with compare to other

Good questions which is some are modrate and some difficult

Online aptitude test with reasoning and java

Q1. Explain all Oops concepts briefly
Ans. 
Oops concepts are fundamental principles of object-oriented programming like inheritance, polymorphism, encapsulation, and abstraction.
• Inheritance: Allows a class to inherit properties and behavior from another class.

• Polymorphism: Ability of objects to take on multiple forms based on the context.

• Encapsulation: Bundling data and methods that operate on the data into a single unit.

• Abstraction: Hiding the complex implemen...read more
Answered by AI
Add your answer
Q2. One basic level java question
Add your answer

Q1. Basic technical discussion for an hour
Add your answer
Q2. Coding on array asc or desc
Add your answer

Again further basic technical discussion for half time and a coding problem

Again same as round 2 and coding test

Discussion abt tech stack and worked assignments and ending with a coding test .This round happens for more experienced ppl by project lead/learning director level guys.The result wl told in their attitude and words here if salary you are expecting is out of their budget..Total wasted my time

Round duration - 90 minutes
Round difficulty - Easy

It was purely a coding round

Q1. Course Schedule
You are a student of Netaji Subhas Institute of Technology. You have to take ‘N’ number of courses labelled from 1 to N to complete your B.Tech Degree.
Some courses may have prerequisites...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 by CodingNinjas
Add your answer
Q2. N queens
You are given an integer 'N'. For a given 'N' x 'N' chessboard, find a way to place 'N' queens such that no queen can attack any other queen on the chessboard.
A ...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 by CodingNinjas
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