Redwood City, CA interview questions | Glassdoor

# Interview questions in Redwood City, CA

Oracle Interviews in Redwood City

www.oracle.com /  HQ: Redwood City, CA

175 Interviews in Redwood City (of 4,154)

2.8 Average

Box Interviews in Redwood City

www.box.com /  HQ: Redwood City

63 Interviews in Redwood City (of 445)

3.1 Average

Informatica Interviews in Redwood City

www.informatica.com /  HQ: Redwood City, CA

52 Interviews in Redwood City (of 420)

3.0 Average

## Interview Questions in Redwood City

Sort: RelevancePopular Date

### Ruby Developer at Wildfire Interactive was asked...

Mar 25, 2012
 Ruby: How to write a sum of numbers in an array in one line? 2 Answerssum = arr.inject(0){|cummulative,num| cummulative+num}eval[arr.join('+'))

May 12, 2015

Feb 10, 2010

### Senior Software Engineer at Oracle was asked...

Mar 19, 2009
 Considering a 2-dimension matrix that can only be traversed by 1 adjacent position at a time and never diagonally. Create an algorithm to traverse that matrix from its upper-left corner to its lower-right corner using the shorter possible path in the most efficient way.6 AnswersThis is a very interesting problem. Although I knew immediately that I had to use recursion to effectively traverse the matrix and eventually got a working algorithm, the catch to make the algorithm much more efficient is to traverse the matrix backwards.How back traverse make the algo efficient?Why not just go all the way down then all the way right? Without diagonal moves the path length is fixed. Unless they provide a different definition for 'shortest length'Show More ResponsesFor a thinking outside the box answer.... assuming the set is closed for indexing, go up -1 and left -1.I guess it's the traversal of a graph's depth first search (DFS) using Adjascent matrix...it is similar to two way BFS. Start from top left and bottom right and then keep moving until they meet.

### Software Developer at Storm8 was asked...

Jan 11, 2012
 /* * Suppose we have a sorted array in ascending order, with no duplicates: * * {1, 2, 3, 4, 5, 6, 7} * * Somehow an unknown amount of numbers at the beginning are shifted to the end, * creating an array that looks like: * 0 1 2 3 4 5 6 * {3, 4, 5, 6, 7, 1, 2} * * Let us call the new array a shifted cyclic array. * * Now, given a Shifted Cyclic Array int a[], and its length n (> 0), write a function * to find the smallest number in the array. */5 Answerspublic static int minimum(int[] a) { int first=0; int last=a.length(); int middle=(first+last)/2; while (last=first+1){ if(a[fist]a[middle]){ last=middle; middle=(first+last)/2; } } System.out.println(a[last]); }What about the rest of the rounds?Except that the solution posted above is wrong.Show More Responseshttp://www.leetcode.com/2010/04/searching-element-in-rotated-array.htmlvar cyclicArray = [7, 10, 14, 15, 100, 1, 3]; function mergeSort(arr) { if (arr.length < 2) return arr; var middle = parseInt(arr.length / 2); var left = arr.slice(0, middle); var right = arr.slice(middle, arr.length); return merge(mergeSort(left), mergeSort(right)); } function merge(left, right) { var result = []; while (left.length && right.length) { if (left[0] <= right[0]) { result.push(left.shift()); } else { result.push(right.shift()); } } while (left.length) result.push(left.shift()); while (right.length) result.push(right.shift()); return result; } console.log(mergeSort(cyclicArray)[0]);

### Software Engineer at Turn was asked...

Mar 15, 2014
 Here is the brain teaser question: Given integers as 1, 2, 3, 4, ..., N. Every time you remove an alternative element until only one is left. If you reach the end, just do a rounding. Return the remaining element. For example, given 1,2,3,4,5,6, you remove 1, 3, 5 and then 2, 6. So the remaining element is 4. What is the remaining element if N is 2000?8 AnswersYou need matched experience. Otherwise don't waste your time.1001?1024Show More Responses1024I'll try to explain why everyone says the answer is 1024. 1) You start from removing all *odd* values, which would leave you just the *even* numbers. (2, 4, 6, etc.) 2) In the next round, you remove all numbers that are *not multiples of 4*. Remaining with (4, 8, 12, etc.) 3) In the next round, you remove all numbers that are *not multiples of 8*. Remaining with (8, 16, 24, etc.) If you repeat this process, you are basically scaling the leading value by 2 and dividing the length of this array by 2. Once the array is size 1, you are returning the leading value. So effectively, you're just going through the values 1, 2, 4, 8, etc. until you reach the biggest value that is smaller than the size of the array.200010241024 is the answer

### Software Engineering at Storm8 was asked...

Apr 4, 2012
 Random coding questions3 AnswersYou must get the optimal way of solving the problem or else it won't count.Can you give some examples of the interview questions?can you mention what question you were asked?

### Data Analyst at Rocket Fuel was asked...

Jun 4, 2013
 Given a plot of land and \$250,000, what can you do to maximize your revenue and what kinds of data would you look at to do so?4 AnswersEverything was done professionally and very well. The onsite interview with the Head of Analytics was shocking. He was very unprofessional. Right when he entered he threw his business card haphazardly for me to catch and seemed to be in a irritable mood. He also seemed disinterested and unprepared for the interview. Needless to say he wasn't happy with anything that came out of my mouth and I didn't get the position despite everything else going well.Should have thrown back his business card at him.Too funny! Good to know.Show More ResponsesI guess one possible answer would be to review what kind of land it is, and check out real estate data of the place on order to see if it's suitable for a residential area. Or check out the community data and see how many families are present and accordingly decide whether to invest in hospitals or schools or malls etc.

### Software Developer at Tidemark was asked...

Nov 4, 2013
 They were all easy.3 AnswersI was flown in to the on-site interview. When I got to the hotel, Tidemark did not pay the room. That's low. On the interview day, I walked in to the office and saw that the work environment is dull, boring, and limited. At that point, I didn't care. I couldn't wait to go back home. There are much better companies than this one to work for.Really!? Where were you flying from? I was thinking about flying in for an interview as well...We take very seriously the time and commitment that you are making in talking and visiting with us. We always pay for the hotel and expenses associated with your trip to see us, we take great pride in making sure that as a candidate you have the opportunity to meet with everyone on the team and also spend time with us to understand and feel our culture. Since the initial comment here is anonymously posted I can't respond specifically to it and our records do not show any lapse in us not honoring expenses for the candidates that came to visit us. I would be glad to personally understand your issues so please contact me directly (cgheorghe at tidemark dot com) and I am sorry that your experience was not on par with what other candidates have seen with us. Our core values are trust and transparency.