[algogeeks] Re: Directi Interview Ques
http://www.ocf.berkeley.edu/~wwu/cgi-bin/yabb/YaBB.cgi?board=riddles_cs;action=display;num=1280183627 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/EyWqplydCDEJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re:
N+=3; print N!-(N^2-1); let me know if I am wrong On Wednesday, 11 July 2012 16:42:38 UTC+5:30, wentworth miller wrote: hi .. can anybody tell the Nth term of the following series... 9 96 685 4992. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/Fs9vaJ4g8bEJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Finding the repeated element
what is the time complexity for the code ?
#includeiostream
using namespace std;
main()
{
int arr[] = { 2,3,4,9,2,7};
int *ptr1 = arr[0];
int *ptr2 = arr[1];
const int SIZE = sizeof arr / sizeof arr[0];
while(1)
{
if(*ptr1 == *ptr2)
{
cout *ptr1 endl;
return 0;
}
if( ptr1 == (arr+SIZE*(sizeof arr[0])))
ptr1=arr;
else
ptr1++;
if( ptr2 == arr[SIZE-2])
ptr2=arr+1;
else if( ptr2 == arr[SIZE-1])
ptr2=arr;
else
ptr2+=2;
}
return 1;
}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/XIpYk-5n94wJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Amazon support engineer
Guys i am having amazon support engg. test tonyt...90 min 27 questions mcq...plz tell how to prepare and wats dis profyl???reply asap..and sory for posting it in algogeeks as i need quick response.waiting for +ve response soon... thnx -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Finding the repeated element
This will help u http://www.geeksforgeeks.org/archives/570 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Finding the repeated element
@Arun: The referenced algorithm solves the wrong problem. The problem given has n-2 unique elements and 1 element repeated twice. The referenced algorithm has n-1 elements that occur in pairs and one that is unique; xoring will solve this problem, but it won't help solve the given one. Dave On Monday, July 23, 2012 12:55:01 PM UTC-5, Arun Kindra wrote: This will help u http://www.geeksforgeeks.org/archives/570 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/EFi5PG1OKTkJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
