Gallagher BI Developer Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Easy

It was an online one on one call that was taken. Like many others, even i too got formal and straight forward with my interviewers. It was pretty good despite the connectivity issues. I have gained by the way they were asking me questions as the nature of the call was quite amicable. It was pretty good as it was during the day for me.

Q1. Longest Common Subsequence
Given two strings, 'S' and 'T' with lengths 'M' and 'N', find the length of the 'Longest Common Subsequence'.
For a string 'str'...read more
Ans. Memoization
Let the two strings be x and y. 
Let x(i) be the substring of x from index 0 to index i. 
Let c[i, j] be the length of the longest common subsequence of strings x(i) and y(j).
Then the recurrence relation to find c[i, j] is as follows:
We can use this relation to write a simple recursive program but instead of recomputing the results of subproblems, compute them just once and store their results in a l...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It was during the night. I was to attend an one on one interview. Though it was a shaky start in the beginning, sporadically i picked up. The affable nature of the interviewer made me feel special and comfortable. He not only asked me normal interview questions but also took me through the technical aspects of an interview and i could get them all!

Q1. Count Subsequences
You have been given an integer array/list 'ARR' of size 'N'. Your task is to return the total number of those subsequences of the array in which all the elements are equa...read more
Ans. 
Step 1 : I first applied bubble sort. It was not good enough.
Step 2 : Interviewer asked me to optimise the solution.
Step 3 : Then I gave solution with merge sort and interviewer was happy.
Answered Anonymously
Add your answer