Software Enginner Interview Questions

Software Engineer

Interviewed at Google

4.4★

Feb 21, 2016

Given a string, find the longest substring T that contains m distinct characters. (need O(n) solution)

Senior Software Engineer

Interviewed at Google

4.4★

Jul 30, 2010

what's wrong with the following code : <template type T > T accumulate ( vector<T> in) { T total = in[0]; for (int i =0; i < in.length() ; i++) { total = total + in[i]; } return T }

Software Engineer

Interviewed at Google

4.4★

Nov 7, 2013

Given n numbers (P1,P2,P3,.....Pn). Divide them in m contiguous partitions such that the sum of the maximum is minimum. For e.g. (5,1,4,2,3) and m =2 then (5,1)(4,2,3)

Software Engineer

Interviewed at Google

4.4★

Aug 17, 2010

There are n pots with different # gold coins in them. Two players play a game, where each player can select a pot at either ends. maximize the gold

Software Engineer

Interviewed at Google

4.4★

Mar 22, 2012

You are given an array that represents bills in certain currency (For example 1, 2, 5, 10) and an amount, for example 17. You should output the number of possible combinations of bills that sum to the given amount. For example, {10, 5, 2} is valid combination, {10, 5, 1 ,1} also. I did not ask questions like does the order of bills matter, i.e. is {10, 5, 2} same as {2, 10, 5}.

Software Engineer Intern

Interviewed at eBay

3.9★

Jan 20, 2011

Questions related to data structures like "What data structure would you use for a browser's BACK & FORWARD ability"

Software Engineer Intern

Interviewed at PayPal

3.6★

Apr 25, 2012

n= 20 for (i=0;i<n; i--) print i the question was to change or replace a only one character in for loop to print 20 times.

Software Engineer

Interviewed at Dropbox

3.9★

Mar 29, 2015

Find all duplicate files by content in your filesystem.

Software Engineer

Interviewed at Meta

3.6★

Oct 28, 2014

1--a 2--b ... 26--z given a digit , return the count of the possible output eg. '1313' --- 4 acac mac mm acm '101' --1 ja cannot discard any digit .

Software Engineer

Interviewed at Meta

3.6★

Dec 30, 2011

Given set of coins and each coin has its unique probability to be head up, say double[] probs stores the probability values for all coins, print out all different cases and accordingly probability.