Flatten Nested Tags Efficiently | Dataford Interview Questions

Given an array of nested category tags, write an efficient algorithm to flatten the structure and remove duplicates for Licorne Society.

Implement flatten_category_tags(tags). The input is a list containing strings or arbitrarily nested lists of strings. Return a flat list containing each tag once, preserving its first occurrence order.

Constraints

0 <= number of top-level elements <= 1,000
The total number of nested lists and tags is at most 10,000
Each tag is a non-empty string
Nesting depth may be greater than one
Preserve the first occurrence order

Function Signature

def flatten_category_tags(tags):

Your question is Flatten Nested Tags Efficiently. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given an array of nested category tags, write an efficient algorithm to flatten the structure and remove duplicates for Licorne Society.

Constraints

0 <= number of top-level elements <= 1,000
The total number of nested lists and tags is at most 10,000
Each tag is a non-empty string
Nesting depth may be greater than one
Preserve the first occurrence order

Function Signature

def flatten_category_tags(tags):

Your question is Flatten Nested Tags Efficiently. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.