Software Developer Interview Questions in Herndon, VA | Glassdoor

Software Developer Interview Questions in Herndon, VA

"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.

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

2 Answers

Distinction to be made between some creational design patterns

1 Answer

What is the best way to find files containing a US phone number in a collection of more than 10000 html files.

1 Answer

Describe a project you are working, tell me how would you scale the application to handle large data.

1 Answer

Not much, more theoretical questions.

What is the difference between a subclass and an interface?

Went over resume and asked about work experiences. Then had a 30 minute whiteboard session asking to code several algorithms.

The technical questions weren't that hard, but they asked a lot of questions like "name a time when you strongly disagreed with someone in your past. How did you resolve it?" Those questions are harder to prepare for.