Design an in-memory file-system searcher. The file-system graph contains directories, regular files, and symbolic links. A query selects regular files by optional suffix and a size range. Traverse from a supplied root and return matching paths in deterministic order. ### Constraints & Assumptions - Directories contain named child entries. - Regular files have a byte size. - A symbolic link refers to another node and may create a cycle. - Multiple paths may reach the same node. - The caller chooses whether symbolic links are followed. ### Clarifying Questions to Ask - Should results identify directory entries or underlying file objects? - Are suffix checks case-sensitive? - Are size boundaries inclusive? - How should broken links and permission failures be reported? ### What a Strong Answer Covers ```premium-lock What a Strong Answer Covers ``` ### Follow-up Questions - Search a real filesystem without holding all results in memory. - Support concurrent directory mutation. - Explain when a visited-node set can incorrectly suppress a desired alias path.