• Dynamic arrays (double array size when out of space, copy contents to new array)
• Amortized complexity is O(n): Inserting n elements cost n. Doubling each array costs 2n.

https://papl.cs.brown.edu/2017/Algorithms_That_Exploit_State.html#%28part._.Abstracting_.Memoization%29