Search Engineer Interview Questions | Glassdoor

# Search Engineer Interview Questions

75

Search engineer interview questions shared by candidates

## Top Interview Questions

Sort: RelevancePopular Date

### Search Engine Marketing Specialist at Annodyne was asked...

Jan 21, 2016
 If you had to pick 3 things you'd need to build out a digital marketing campaign for a community college, what would you want? 1 AnswerA budget, the ability to gather data (courses, programs, degrees, etc offered), and access to any applicable advertising platforms.

Jun 30, 2010
 Find the Kth hisghest element in a given array.5 Answers1. Sort the array and get the element. 2. Put in binary tree. Travel from root and get the kth node.binary tree would not work unless it was balanced and even then searching for the kth highest node would be overly complex. Better answer - Perform k iterations of a bubble sort. Run time would be O(kn). To prevent O(n^2) (k ~ n) reverse bubble sort if k > n/2.http://en.wikipedia.org/wiki/Selection_algorithmShow More Responsesborrow the way of splitting array in quicksort, which can achieve O(n) time in average for any k. The more detail of this algorithm is: select a pivot value, and split the array into three parts. The elements in the first part are less or equal to the pivot value or empty, the second part is one element which is equal to the pivot, and elements in the last part is great them the pivot value or empty. If the index of the second part element is equal to k, then just return it, else if it is greater than k, then go to split the first part recursively, else go to split the third part recursively.function _kth(array, k) { return array.sort(function (a, b) { return b - a; }).slice(0, k); } _kth([1, 23, 12, 9, 30, 2, 50], 3); // [50, 30, 23]

Jun 30, 2010
 randomize an array.4 Answersjust run the random funtion and replace elements.To perform perfect randomization of an array of elements there is a well known method (all n! permutations of the array are equally probable assuming a perfect random number generator) public static void randomize(int[] a) { int tmp, index; for (int i = 0; i < a.length; i++){ index = (int) (Math.random() * (a.length - i)) + i; tmp= a[i]; a[i] = a[index]; a[index] = tmp; } }Use the Knuth shuffle: http://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffleShow More Responses[1, 2, 3, 4, 5].sort(function () { return 0.5 - Math.random(); });

Jun 30, 2010
 In a given list of words, find matching words in the list that can be generated from the patterns of a given word.2 Answers1.Get all the permutations of the given word and store them into a hashtable(O(k!), where k is the length of the given word), which can have constant look up time in average. 2. The go through the list of words (O(n), where n is the lengh of the list), to find the words that can also found in the hashtable. So, the total computation time is O(k! + n). If k is assumed a limited constant, then the time will be O(n), and hashtable can also be replaced by the prefix tree (trie).just sort the letters of each word in the list and pattern and find what you need with a string compare.

### Software Engineer Search Analytics at A9.com was asked...

Sep 16, 2011
 How to grep phone numbers in Unix directory. The files are spread across the directory tree. 1 Answergrep with a regex

### Software Engineer Search Analytics at A9.com was asked...

Sep 16, 2011
 inner join and outer join definitions. and normalization1 AnswerObvious

Dec 26, 2015
 How many characters in a title tag?1 AnswerThere are different schools if thought on this, but I was taught 125, other people say about half that.

Dec 26, 2015
 What does cpc mean?1 AnswerCost per click.