Extramarks Education QA Engineer Interview Questions and Answers

Round duration - 120 minutes
Round difficulty - Easy

It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium level. Time was enough and no sectional time was present. 1-2 MCQs on SQL were also present.

This round was immediately followed by an SHL aptitude test which was basically a quick limited time check of your verbal ability and math because many questions were to be done in 1 hour.

Q1. 
Boolean Matrix Transformation Challenge
Given a 2-dimensional boolean matrix mat of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...read more
Ans. 
Modify a boolean matrix such that if any element is 1, set its entire row and column to 1.
• Iterate through the matrix and mark rows and columns to be modified

• Use additional arrays to keep track of rows and columns to be modified

• Update the matrix in-place based on the marked rows and columns
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It was an online video interview round on HackerEarth with simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class which required inheritance was asked by the interviewer to write. I was helped by the interviewer if i got stuck somewhere, Some questions on implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.

Round duration - 70 minutes
Round difficulty - Easy

We're provided with 60 minutes.
We're provided with desktop as it was online test.

Q1. 
Leap Year Checker
Determine if a given year, represented as an integer 'N', is a leap year.
A leap year is defined as a year with 366 days, unlike a normal year which has 365 days.
Input:
The initial i...read more
Ans. 
The task is to determine if a given year is a leap year or not.
• Check if the year is divisible by 4, if yes then proceed to next step

• If the year is divisible by 100, then it should also be divisible by 400 to be a leap year

• If the year satisfies both conditions, output 'Yes', else output 'No'
Answered by AI
Add your answer

Round duration - 25 minutes
Round difficulty - Easy

They basically ask questions related to operating system

Round duration - 15 minutes
Round difficulty - Easy

There were 2 interviewers who talked to me and ask different questions regarding my company, my experience in college etc.
It was kind of chit chat but basically they were testing my conversation skills.

Round duration - 60 Minutes
Round difficulty - Easy

It was an coding round

Q1. 
The Skyline Problem
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...read more
Ans. 
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.
• Iterate through the buildings and create a list of critical points (x, y) where the height changes.

• Sort the critical points based on x-coordinate and process them to form the skyline.

• Merge consecutive horizontal segments of equal height into one to ensure no duplicates.

• Return the fin...read more
Answered by AI
Add your answer
Q2. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze from source to destination.
• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid revisiting them.

• Recursively try moving in all directions (up, down, left, right) until reaching the destination.

• Return a list of strings representing valid paths sorted in alphabetical order.
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It was an HR round with some general questions. it was just for formality.