MAQ Software interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

MAQ Software

1 rounds | 1 Coding problems

Suraj Singh

Fresher | Jan 2022

Selected

Interview preparation journey

Preparation

Duration: 4 months

Topics: Data Structures, OOPS, Algorithms, Python Programming, SQL.

Tip

Tip 1 : Prepare basics of Programming like Lists and Strings.
Tip 2 : Algorithms for sorting and searching are very important for Coding interviews.

Application process

Where: Coding Ninjas

Eligibility: Above 60 % in 10th, 12th and graduation.

Resume tip

Tip 1 : Projects are a must on resume.
Tip 2 : Keep the resume simple but answer every question on resume very well.

Interview rounds

Round

Easy

Online Coding Test

Duration50 minutes

Interview date31 Jan 2022

Coding problem1

The interviewer asked to tell me about myself and then asked some questions to solve like some questions on Lists, Strings and Numbers like comparing 2 strings, performing some operations on lists etc.

1. Check If Given Words Are Present In A String

Hard

35m average time

60% success

0/120

Asked in companies

Given a string 'S' and a list 'wordList' that consists of 'N' distinct words. Let 'Wi' denote word at index 'i' in 'wordList'. For each word 'Wi' in 'wordList', you need to determine whether it is present in string 'S' or not. Return a boolean array, where a boolean value at index ‘i’ represents whether the word ‘Wi’ is present in the string ‘S’ or not.

Problem approach

1) Make a boolean vector ‘result’ of size ‘N’. Initially, all the elements of this vector should be ‘False’.

2) Run a loop where ‘i’ ranges from 0 to ‘N-1’ and for each word ‘Wi‘ present at ‘ith’ index of ‘wordList’, we will check whether ‘Wi‘ is a substring of string ‘S’ or not. This can be done as follow :
1. If the length of ‘Wi’ is greater than ‘S’, then it cannot be a substring of ‘S’.
2. Otherwise, we need to run a nested loop where the outer loop ranges ‘j’ from 0 to |S|-|Wi| and the inner loop ranges ‘ k’ from 0 to |Wi|-1. And we need to check whether there exist any index ‘ j’ in ‘S’ such that for all ‘k’ from 0 to |Wi|-1, character at ‘j+k’ index in ‘S’ is the same as ‘kth’ character of string ‘Wi’. If such index ‘j’ exists only then ‘Wi’ is a substring of ‘S’.
3. If ‘Wi’ is a substring of ‘S’. then set result[i] = true.

3) Return the result array.

Try solving now