Question: Which of the following scenarios is best suited for using a hash table?

Options:

1. When order of elements is important
2. When frequent insertions and deletions are required
3. When searching for elements by key is needed
4. When elements need to be sorted

Correct Answer: When searching for elements by key is needed

Solution:

Hash tables are ideal for scenarios where fast searching by key is required, as they provide average O(1) time complexity for lookups.