# Design In-Memory File System: Practice Notes
Design In-Memory File System shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A trie of path segments: directories hold a map of children, files hold content. ls on a file returns [filename]; ls on a directory returns sorted child names. mkdir walks/creates directories; addContentToFile creates a file and appends; readContentFromFile returns the stored string.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(L) per path of length L, plus sorting for ls.
## Common mistake
Treating the whole path as a single map key and then failing to list intermediate directories, or forgetting ls on a file is special-cased.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at https://www.linkjob.ai/.