Yes, I believe you are intended to duplicate the table once a certain load factor (fraction of elements filled) of your choosing is reached.

For linear probing, this is recommended to keep your probe lengths logarithmic:

https://www.sciencedirect.com/science/article/abs/pii/019667...

Removing elements for a hash table using linear probing is fairly non-trivial. Without using so-called “tombstones” to flag an element as deleted, you essentially have to shift elements up in the table.

Also, your rudeness is really quite unwarranted. If everyone took that attitude, where would the teaching examples ever come from?