Hash codes should use all of the fields.

Any perms of strings with the same letters will have the same hashcode, therefore this is a bad hash function.

The worst case runtime for put is O(n). The best case runtime for put is O(1). Space complexity for put is O(1).

Best case runtime for get is O(1) and worst case is O(n). Space complexity for get is O(1).

The load factor is the number of key value pairs (N) divided by the table size (M), so (\frac{10}{5}).