Quest Technologies Interview Questions and Answers

Round duration - 40 Minutes
Round difficulty - Easy

The round began at about 3:30 pm. The environment was good and the interviewer was very calm and humble. At the beginning he asked me some general questions so as the make me comfortable, like tell me about yourself and what you did today. After that he came upon my project and about 80% of the interviews discussion was around my project.

Q1. 
All Prime Numbers Less Than or Equal to N
Given a positive integer N, your task is to return all the prime numbers less than or equal to N.
Note:
1) A prime number is a number that has only two factors:...read more
Ans. 
Return all prime numbers less than or equal to a given positive integer N.
• Iterate from 2 to N and check if each number is prime using a helper function.

• A number is prime if it is not divisible by any number from 2 to its square root.

• Store and return the prime numbers found in an array in increasing order.
Answered by AI
Add your answer
Q2. 
Implementing Queue with Two Stacks
Your task is to implement a queue using two stacks. You are provided with ‘Q’ queries and need to handle them, where each query falls under one of these two operations:
...read more
Ans. 
Implement a queue using two stacks with enqueue and dequeue operations.
• Use two stacks to simulate a queue - one for enqueue and one for dequeue.

• For enqueue operation, push elements onto the enqueue stack.

• For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.

• Return true for successful enqueue and the dequeued element for successful dequeue.
Answered by AI
Add your answer
Q3. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. 
Determine if two strings are anagrams of each other by checking if they have the same characters in different order.
• Create character frequency maps for both strings and compare them.

• Sort both strings and compare if they are equal.

• Use a hash table to store character counts and check if they are the same for both strings.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It was video call round in teams which went for around 90 minutes. Interviewer is flexible and it went well.

Q1. 
Search in a 2D Matrix
Given a 2D matrix MAT of size M x N, where M and N represent the number of rows and columns respectively. Each row is sorted in non-decreasing order, and the first element of each ro...read more
Ans. 
Implement a function to search for a given integer in a 2D matrix with specific properties.
• Iterate through each row of the matrix and perform a binary search on each row to find the target integer.

• Since the rows are sorted, binary search can be applied efficiently to determine if the target exists in the matrix.

• Handle edge cases such as empty matrix or invalid input values.

• Return 'TRUE' if the target is found in the ma...read more
Answered by AI
Add your answer
Q2. 
Find First Unique Character in a String
You are given a string S of length N. Your task is to find the index (considering 1-based indexing) of the first unique character in the string. If there are no uni...read more
Ans. 
Find the index of the first unique character in a given string, return -1 if no unique characters are found.
• Iterate through the string to count the frequency of each character

• Iterate through the string again to find the first character with frequency 1

• Return the index of the first unique character or -1 if none found
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Interview went arounf 30minutes at 10AM. As it was hr round there wont be any technical stuff and I have only concentrated on my communication skills and had a glance of frequently asked hr questions before interview. It was more of a discussion.