Software Interview Questions in Boston, MA | Glassdoor

# Software Interview Questions in Boston, MA

1,554

Software interview questions shared by candidates

## Top Interview Questions

Sort: RelevancePopular Date

### Software Engineer/Java Developer at BzzAgent was asked...

Dec 17, 2012
 Lots of questions about arrays, lists and hashmaps1 AnswerFocus more on how hashmap works and its applications

### Java Software Engineer at Help Scout was asked...

May 24, 2016
 Write a method to determine if a string starts with an uppercase letter.1 Answerwouldn't it just be return string.charAt(0) == string.charAt(0).toLowerCase()

Jan 21, 2010

Oct 17, 2011

### Financial Software Developer at Bloomberg L.P. was asked...

Mar 25, 2011
 6 face dice. He rolls 1 to win, and me 6. He rolls first, what's the probability that he eventually win.3 AnswersI didn't answer the exactly number...but it's fine.1/6 + (5/6)^2 * (1/6) + (5/6)^4 * (1/6) +.... = 6/11Here, there are infinite possibilities. He might win in his first attempt, or second attempt, or third attempt or so on... So the probability goes like this: (1/6) + (1/6)^2 (5/6) + (1/6)^3 (5/6)^2.... If you read the pattern....it is in geometric series with initial value as (1/6) and the ratio of (1/6).(5/6)...And we can solve this question further by applying geometric series.

### Financial Software Developer at Bloomberg L.P. was asked...

Mar 25, 2011
 sorting the red and green balls.RRRRRGGGGGGGG to RGRGRGRGRGGGGG3 AnswersThis will be a simple, intuitive way. It doesn't guarantee any efficiency. Count the number of R's in RRRRRGGGGGGGG. Then, we will also have the number of G's by subtracting the number of R's from the total size. Now you we compare two values, here R is less than G. So we create a new array with initial total size with everything initialized as lets say A. Replace A with R on alternate slot. Then replace the rest with G. The time complexity for this will be O(n)Or you can keep track of count and work accordingly.If we know the number of reds, then we can swap with green ball starting from index 1 till red balls finish by skipping 2.

### Software Engineer at Next Jump was asked...

Jun 23, 2011
 How would you center a div?3 AnswersI said to use tags but they wanted a CSS answer, which I didn't know (I was really trying to get a job as a PHP dev with minimal UI).#divname{ width: 50%; margin: 0px auto; }

Jul 15, 2011
 Find the largest 100 numbers out of a list of a trillion unsorted numbers4 AnswersUse a heap to hold the 100 largest numbers so far. If the new number is larger than the heap top (the smallest number in the heap) pop it out and add the new number. The worst case complexity is O(N * log(100)). Hence log(100) is a small constant (7) the complexity should be good enough.That's a great idea. Another approach could be using a select algorithm to select the N-100 biggest number in O(N) time and then partition around its value, again in O(N), to get the 100 biggest numbers (in unsorted order). Note that this is actually independent of how many of the largest numbers you need.Would it be crazy to just merge sort the numbers and then print the last 100?Show More Responses@Chris - yes, because mergesort is O(n logn) where n = 1 trillion; sorting is _highly_ inefficient in this case.

### Software Engineer Intern at Intuit was asked...

Feb 16, 2011
 How will you make this code readable (given a piece of code)3 AnswersClass names were weird.1. use meaningful conventions and variable names , in Classes , methods , interfaces , packages etc 2.putting comments wherever possible to make the code more readable 3. make code more modular , by dividing the code into functions and the main codeHey guys I used rooftop slushie to get Intuit interview information. You should give it a try! https://wwww.rooftopslushie.com