CareerCup

as far as detecting loops in a linked list...one soln is to see the linked list as a graph with nodes as vertices....and cycle detection in a graph can be done with back edges in O(n) time.

Take two pointers to traverse the list. Keep incrementing the first pointer by one(i.e make it point to next node) and the second pointer by two. After every increment check whether they point to same node. If they do then that is the node where the loop is.

n=----
for(i=0;i<sizeof(int)*8;i++)
{
if(n&1)
{
c++;
n>>1;
}

printf ("%d",c);

i=0;
while (x) 
{
   ones+=((x>>i++)&0x1);
}

Simple, keep on adding data into a array, and on nextElement traversal, check if the data matches with any stored in the array.