What values should I pass to create an efficient `HashMap` / `HashMap` based structures for N items?

In an `ArrayList`, the efficient number is N (N already assumes future grow). What should be the parameters for a `HashMap`? ((int)(N \* 0.75d), 0.75d)? More? Less? What is the effect of changing the load factor?