Hash tables handle collisions by checking for hash first, then checking for equality between the remaining candidates. Collisions always happen in hash tables since they always truncate the hash anyway.