Fareportal Senior Test Engineer Interview Questions and Answers for Experienced

It was 7 questions in which 5 were MCQ which had SQL etc
2 coding questions of medium level

Q1. 2 questions were asked. Both were coding questions and it was purely a coding round. Word problem based questions.
Add your answer

I was asked two problem solving question and i was able to code both problem with multiple approaches.
Also i was asked two technical question, in which i was able to answer one question. even then, i was not shortlisted for next round.

Q1. Unique Paths (2d-dp)
Add your answer
Q2. Flip any rows or columns at any time to make the sum of gird cells ofa provided square in a matrix should be minimum
Ans. 
To minimize the sum of grid cells in a square matrix, flip rows or columns as needed.
• Identify the rows or columns with the highest values and consider flipping them to reduce the sum

• Try different combinations of flipping rows and columns to find the minimum sum

• Consider using dynamic programming or backtracking to efficiently explore all possible combinations
Answered by AI
Add your answer

Q1. Fundamentals and Basics of android, projects you are worked on.
Add your answer

It was sort of pair programming where you will be told to implement some feature. Here they check your coding style, your approach and the architecture you follow.

Q1. Advanced android questions were asked and some scenario based questions.
Add your answer

Q1. It was managerial round, most discussion were on my projects and past experience.
Add your answer

Q1. Find the missing smallest positive integer
Ans. 
Find the missing smallest positive integer in an array of integers
• Sort the array to easily identify missing integers

• Iterate through the sorted array to find the smallest missing positive integer

• Return the missing integer
Answered by AI
Add your answer
Q2. Given an array of 0,1,2, Sort the array
Ans. 
Sort an array of strings containing only 0, 1, and 2.
• Use a three-way partitioning algorithm like Dutch National Flag algorithm to sort the array in a single pass.

• Keep track of three pointers - low, mid, and high to partition the array into three sections.

• Swap elements based on their values to achieve the sorted array.
Answered by AI
Add your answer

KMP algorithm was asked, need to give efficent solution

I was asked questions about a doubly linked list, specifically regarding how to add songs to a playlist and play them from the start, end, or a specified ID. Additionally, I was required to delete a song and report on the total number of times each song was played overall and by each individual.