Easy Remember Hash Tables Multiple Choice

What is the time complexity of checking if a string is an anagram of another using a frequency array?

Remember — Tests recall of fundamental facts and definitions.

Answer Options

A O(1)

B O(n)

C O(n log n)

D O(n²)

Want to see the correct answer?

Get the answer with a detailed explanation, plus practice 32+ more Hash Tables questions with adaptive quizzes and timed interviews.

See the Answer on Guru Sishya →

This question is from the Hash Tables topic (Data Structures).

Learn Hash Tables → Browse All Questions

More Hash Tables Questions

What is the average time complexity of inserting into a hash table?

What is the difference between a JS Map and a plain Object for use as a hash map?

In Two Sum (LC 1), what is stored as key and value in the hash map?

Why does grouping anagrams with a sorted-string key cost O(n*k*log k) while a frequency-count key costs O(n*k)?

What does a hash collision mean and how does separate chaining resolve it?