Software Developer Interview Questions in Washington, DC | Glassdoor

Software Developer Interview Questions in Washington, DC

"Software developers design, write, test, and maintain the code for a software system. Extensive knowledge of programming languages, data structures, and algorithms are necessary to pass the technical interview which is designed to test these skills. Employers are looking for candidates with a bachelor's degree in computer science or related field or equivalent work experience. "

Top Interview Questions

Sort: RelevancePopular Date

How would you find a duplicate number in a very large unsorted array of ints.

4 Answers

findDuplicates(int array[]) { int duplicates[] , index; for (int i=0; ii; j--) { if (array[i] == array[j]) { duplicates[index++] = array[i]; break; } } print duplicates;

O(n^2) is the usual naive answer but there are properties that if true can reduce this to O(n) using bit ops: In general, if the given array range can also be generated where the duplicated number you are trying to find gets no special treatment and is included just like all the rest a single time, then you can get the answer this way: set total to 0 foreach (n in given array) xor all n into total foreach (n in generated range) xor all n into total total is your answer This works because all the non-duplicated single entries will cancel out via xor with their single entry from the generated set (since they are all paired) and the duplicated number will have an extra odd entry (since it will have 2 entries already from the given array + 1 from the generated set = 3 entries). And because of course xor is commutative; the order of the xor'ing doesn't matter: 6^6^5^5^4^4 = 0, as does 6^5^4^5^4^6 It is a variation of these problems: - find a missing number in an unsorted array - find an unduplicated number in an unsorted array of duplicates

I should have added t the above: Ask the interviewer if the array of N has any special distribution. In particular, for the duplicate question here, ask if the array of N contains [0, N-2] or [1, N-1] values unsorted, in addition to one extra entry duplicated in that set duplicated.

Why do you choose IBM as your future employer?

2 Answers

You have a 100 story building and two glasses. By dropping glasses from a given floor, figure out what is the highest floor from which you can drop and glass and it will not break.

2 Answers

what would you do if you are not able to handle a team?

2 Answers

What is the range of numbers that can be stored using a single byte?

2 Answers

what is your career goal

1 Answer

Distinction to be made between some creational design patterns

1 Answer

1. Which data structure is good for memory management stacks or heaps and why? 2. How do you swap 2 variables w/o using a third variable?

1 Answer

They asked me to show how I could loop over the words in a sentence backwards.

2 Answers

I was asked to provide code that would go from 1 to 100 and print out "Woo" for every number that is divisible by 3, and "Ha" for every number that is divisible by 5.

1 Answer