Design a File System (Trie variant)

To solve this, I would design a Trie-based File System class. First, let's clarify that we need to prevent creating a child path if a parent path already exists as a complete file, such as preventing '/a/b' if '/a' is already created. For the data structure, a Trie is ideal because it naturally represents the hierarchy and allows efficient prefix checks. Each node will contain a hash map for children and a boolean flag indicating if that specific path is valid. When implementing createPath, I split the input by slashes and iterate through the root. If a child node doesn't exist, I create it. Crucially, before marking a new path as valid, I must verify that no ancestor was previously marked as a terminal path. If the path already exists, I return false. For the get method, I simply traverse the tree using the path segments. If I reach the end and the current node's terminal flag is true, I return true; otherwise, false. This approach ensures both methods run in O(K) time, where K is the number of path components, making it highly scalable for Salesforce's large-scale resource management needs. The space complexity is proportional to the total number of unique characters across all stored paths.