What method do you use to find the missing number in an integer array of 1 to 100?
Interview questions about finding missing numbers in an integer indicate that the interviewer at Amazon has a specific type of role in mind for a candidate. More than likely, they are looking for an analytical thinker who can solve problems relatively easily. Say you have an array number from 1 to 100. These are just random numbers for now. In a sorted array, you can compare whether a number is equal to the expected next number or not. Alternatively, you can also use the BitSet method in Java to solve this problem. A BitSet solution is more general, as you can use it to find more than one missing value on an integer array. Take your time to consider how you will respond to these questions because the interviewer is testing your ability to process and come up with an answer.
"Having many tools at my disposal, I find that a Java solution is the best way to solve this problem. I would typically write a program to find the missing number in an array in Java, C#, or another language. Looking at this problem from a high level, this can easily be solved by calculating the sum of the series using n(n1)/2 to solve this problem. It's a quick and efficient way to do it, but it cannot be used if the array contains more than one number or if the array contains duplicates. These solutions might require you to calculate the sum of numbers and then subtract that from the actual sum to arrive at the correct answer. Is this similar to the methodology used here at Amazon?"
