You should be comfortable with basic arrays, as hash maps often store array elements or their indices as values. Understanding key-value lookups and their average time complexity is needed for recognizing when hash maps apply.
Hash map problems often reduce brute force to by storing previously seen elements for instant lookup. Practice the classic Two Sum problem to build this intuition before tackling harder patterns.