Compute Folder Size Recursively | Dataford Interview Questions

Compute the total size of a folder (directory tree) using recursion.

Represent each folder as a dictionary with files, a list of nonnegative file sizes, and folders, a list of child folder dictionaries. Return the sum of every file size in the folder and all descendants.

Function: def folder_size(folder):

Input: One folder dictionary. Output: A nonnegative integer.

Example: {"files": [10, 5], "folders": []} returns 15. A folder containing {"files": [4], "folders": [{"files": [6], "folders": []}]} returns 10.

Constraints: folder nesting depth is at most 500, each folder has at most 100 direct files and 100 direct subfolders, and file sizes are nonnegative integers.

Constraints

0 <= folder nesting depth <= 500
Each folder has at most 100 direct files
Each folder has at most 100 direct subfolders
File sizes are nonnegative integers
The input is a valid directory tree with no cycles

Function Signature

def folder_size(folder):

Your question is Compute Folder Size Recursively. 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