CareerCup

Hash entry from input queue, use %3 to decide which queue it goes into:

int hash = hashFunction(inputQueue[i])

switch(hash%3)
{
  case 0: outputQueue1.enqueue(inputQueue[i]); break;
  case 1: outputQueue2.enqueue(inputQueue[i]); break;
  case 3: outputQueue3.enqueue(inputQueue[i]); break;
}

We can implement this using a queue which implements hash table.
1) We maintain a head an tail pointer.
2) A new entry is inserted into the queue based on hash index.
3) Next pointer of tail is updated to pointer to this location.
i.e. tail->next = newPointer.
4) Tail is updated to point to the new location.
tail = newPointer.