2 replies to this topic

[dixiragh]

//there is an array of size N in which every number is between 1 and N , determine if there are any duplicates in it.

// I'll try to do it in O(N) w/o using any additional memory. the key is to use content of the array as index into array.

// checking in O(1) if that number has been seen already.

[WingedPanther]

Given that this is homework, what is your question about it?

[cdg10620]

Forum != PrivateTutor

While( !User.hasAnswer )
{
     User.askQuestion();

     if( User.postCode && User.putForthEffort )
     {
          CodeCallMembers.Help();
          User.hasAnswer = true;
     }
     else
     {
          CodeCallMembers.Laugh();
     }
}