Process Nested Folders and Deduplication | Dataford Interview Questions

Write code to process nested folders/files, print their full names, and deduplicate them.

Asked in the Technical Screen stage. Represent the hierarchy as nested dictionaries. Each node has name, type, and, for folders, a children list. Return unique full paths in depth-first traversal order. The root path must be included, and duplicate paths must appear only once.

Function Contract

deduplicate_full_names(root) accepts one folder dictionary and returns a list of strings. Paths use / as the separator.

Constraints

The root node is a folder dictionary.
Each node contains name and type; type is either folder or file.
Folder nodes contain a children list, which may be empty.
Names are non-empty strings and do not contain /.
The total number of nodes is at most 10^4.
Duplicate names may occur among siblings.

Function Signature

def deduplicate_full_names(root):

Your question is Process Nested Folders and Deduplication. 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