Dataford
Interview QuestionsInterview GuidesExperiencesCoaching
New
Pricing
Get started
Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
Experiences
Practice
Mock InterviewsTimed interview simulations with feedbackCoaching1:1 coaching with people at your target companiesSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Build my plan
Traverse and Process Files
00:00
5 left

Traverse and Process Files

EasyPython

Problem

Capgemini Invent delivery pipelines may need to inspect a nested collection of files before processing analytics inputs. Implement a function that traverses an in-memory directory tree, finds files with a requested extension, and returns their paths and sizes.

Use a nested dictionary to represent the directory structure. Each dictionary key is a file or directory name. A dictionary value represents a subdirectory, while an integer value represents a file size in bytes. The input dictionary represents the root directory and has no name of its own.

Return a dictionary with files and total_size keys. files must contain matching file records with path and size fields, ordered lexicographically by full path. Match the extension exactly and case-sensitively. A file matches when its name ends with the requested extension.

Formal Specification

  • Input: tree, a nested dictionary whose values are either dictionaries or non-negative integers, and extension, a non-empty string such as .csv.
  • Output: A dictionary containing files, a list of {"path": string, "size": integer} records, and total_size, the sum of matching file sizes.
  • Directory and file names contain no / characters.

Constraints

  • 1 <= total number of files and directories <= 10^5
  • 0 <= file size <= 10^9
  • Directory nesting depth is at most 1,000
  • Directory and file names contain no / characters
  • The extension is a non-empty, case-sensitive string

Function Signature

def process_files(tree, extension):
Interviewer

Your question is Traverse and Process Files. 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.

You need to log in / sign up to run or submit.
CodePython 3
Sign up free to run your codeLog inLn 2
Run your code to see test output here.