Is not it O(n)? --- On Thu, 9/6/11, ankit arun <[email protected]> wrote:
From: ankit arun <[email protected]> Subject: [algogeeks] Re: MS Interview To: "Algorithm Geeks" <[email protected]> Date: Thursday, 9 June, 2011, 11:49 AM part 1 can be solved in O(1) complexity.. first adding all the numbers and then subtracting it from 4,000,000,000 will give the result. On Jun 9, 2:45 pm, Dumanshu <[email protected]> wrote: > Q1. I have a file in which there are supposed to be 4 billion > numbers, > starting from 1 to 4,000,000,000 but unfortunately one number is > missing, > i.e there are only 3,999,999,999 numbers, I need to find the missing > number. > > Q2. I have an array consisting of 2n+1 elements. n elements in it are > married, i.e they occur twice in the array, however there is one > element > which only appears once in the array. I need to find that number in a > single pass using constant memory. {assume all are positive numbers} > Eg :- 3 4 1 3 1 7 2 2 4 > Ans:- 7 -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
