How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

What difficulty level is this interview question?

This is a medium difficulty Coding & Algorithms question, commonly asked during Technical Screen rounds at Millennium.

What role is this question designed for?

This question is commonly asked for Software Engineer candidates at Millennium during technical interviews.

Design a data structure to store anagrams | Millennium Interview Question

Q: Design a data structure to store anagrams

This question evaluates proficiency in data structures and algorithms for string grouping and lookup, testing skills in string manipulation, canonicalization/hashing concepts, memory-time trade-offs, and handling duplicates.

Problem

You are building a small in-memory service that stores words and can return all stored words that are anagrams of a query.

Design and implement a data structure AnagramStore supporting the following operations:

add(word: string) -> void : Add a word to the store (duplicates may exist).
getAnagrams(query: string) -> list<string> : Return all words previously added that are anagrams of query (including the word itself if it was added). The order of the returned list does not matter.

Two words are anagrams if they contain the same letters with the same frequencies (case-insensitive; assume input is lowercase a-z unless you state otherwise).

Example

Add: "eat" , "tea" , "tan" , "ate" , "nat" , "bat"
getAnagrams("ate") can return: ["eat", "tea", "ate"]
getAnagrams("ant") can return: ["tan", "nat"]
getAnagrams("tab") can return: ["bat"]

Constraints (you may assume)

Up to 10^5 total add operations
Word length up to 100

Requirements

Explain the time and space complexity of your approach.
Discuss how you would handle duplicates (e.g., adding the same word multiple times).

Problem

You are building a small in-memory service that stores words and can return all stored words that are anagrams of a query.

Design and implement a data structure AnagramStore supporting the following operations:

add(word: string) -> void : Add a word to the store (duplicates may exist).

getAnagrams(query: string) -> list<string> : Return all words previously added that are anagrams of query (including the word itself if it was added). The order of the returned list does not matter.

Two words are anagrams if they contain the same letters with the same frequencies (case-insensitive; assume input is lowercase a-z unless you state otherwise).

Example

Add: "eat" , "tea" , "tan" , "ate" , "nat" , "bat"

getAnagrams("ate") can return: ["eat", "tea", "ate"]

getAnagrams("ant") can return: ["tan", "nat"]

getAnagrams("tab") can return: ["bat"]

Constraints (you may assume)

Up to 10^5 total add operations

Word length up to 100

Requirements

Explain the time and space complexity of your approach.

Discuss how you would handle duplicates (e.g., adding the same word multiple times).

Design a data structure to store anagrams

Quick Overview

Problem

Example

Constraints (you may assume)

Requirements

Submit Your Answer to Earn 20XP

Design a data structure to store anagrams

Quick Overview

Problem

Example

Constraints (you may assume)

Requirements

Submit Your Answer to Earn 20XP