Solutions

• Pick a reasonable array size and reduce the hash codes to fall inside the array

  int h = x.hashCode();
  if (h < 0) h = -h;
  h = h % size;

• When elements have the same hash code:
  • Use a node sequence to store multiple objects in the same array position
  • These node sequences are called buckets