What is the optimal time complexity to determine if two strings of length n are anagrams of...
Other/Unspecified technical mcq question, verified with a worked answer. Free to practise - no sign-up.
What is the optimal time complexity to determine if two strings of length $n$ are anagrams of each other using a frequency table?
Show answer & explanation
Answer: A. O(n)
Verified technical evaluation based on core computer science and mathematical principles.
Step-by-step Derivation:
Step 1: Parse problem constraints.
Step 2: Compute verified solution.
Step 3: Select matching option.