1. Store the values into a hash table with 10 buckets, each containing three slots. If a bucket is full, use the next (sequential) bucket that contains a free slot.
2. Store the values into a hash table that uses the hash function ke y % 10 to determine which of 10 chains to put the value into.