How to find a duplicate element in an array of shuffled consecutive integers?

by

Just add them all up, and subtract the total you would expect if only 1001 numbers were used from that.

Eg:

Input: 1,2,3,2,4 => 12
Expected: 1,2,3,4 => 10

Input - Expected => 2

More Related Contents:

  1. maximize the top element of the stack after performing exactly K operations
  2. Algorithm for all subsets of Array
  3. How to sort in-place using the merge sort algorithm?
  4. Easy interview question got harder: given numbers 1..100, find the missing number(s) given exactly k are missing
  5. Algorithm: efficient way to remove duplicate integers from an array
  6. Finding three elements in an array whose sum is closest to a given number
  7. Given an array of numbers, return array of products of all other numbers (no division)
  8. How to find the kth smallest element in the union of two sorted arrays?
  9. Algorithm to find k smallest numbers in array of n items
  10. How do you efficiently generate a list of K non-repeating integers between 0 and an upper bound N [duplicate]
  11. Can min/max of moving window achieve in O(N)?
  12. Print two-dimensional array in spiral order
  13. Find the majority element in array
  14. How to divide a set into two subsets such that difference between the sum of numbers in two sets is minimal?
  15. Binary Search algorithm implementations
  16. Algorithm to determine if array contains n…n+m?
  17. Find the 2nd largest element in an array with minimum number of comparisons
  18. Find all subsets of length k in an array
  19. Maximum single-sell profit
  20. In-place array reordering?
  21. find pair of numbers in array that add to given sum
  22. Regarding in-place merge in an array
  23. how to combine duplicate rows and sum the values 3 column in excel
  24. Interview question: three arrays and O(N*N)
  25. How to find repeating sequence of characters in a given array?
  26. Maximum sum of non consecutive elements
  27. Finding kth smallest number from n sorted arrays
  28. calculating the number of “inversions” in a permutation
  29. Algorithm to apply permutation in constant memory space
  30. Find the first element in a sorted array that is greater than the target

Leave a Comment