Leetcode DSA Data-Structures

<< ---------------------------------------------------------------- >>

--- Last Modified: $= dv.current().file.mtime

Hashmaps

<< ---------------------------------------------------------------- >>

Basics

Access time and write time is O(1), space complexity is O(n) or can be O(n), it had a log formula that i have to look up to see how big and when it approaches that todo

Java Syntax

	HashMap <TypeInterface, TypeInterface> name = new HashMap<>();