Design a File System (Hash Map and Set)

To design this simplified file system, I will start by clarifying the requirements. We need an `addPath` method to store a value at a specific string path and a `get` method to retrieve it. Since we only need exact matches and not prefix searches, a Hash Map is the optimal choice. The keys will be the full path strings, such as '/home/user/docs', and the values will be the stored data. This ensures O(1) average time complexity for both operations, which aligns with Amazon's focus on efficiency. For the implementation, I will initialize a private HashMap instance. In the `addPath` function, I will check if the input path is valid; if so, I will insert the key-value pair directly. If the path already exists, I will overwrite the existing value unless specified otherwise. The `get` function will simply return the value associated with the key or a default null if the key does not exist. I must also handle edge cases like empty strings or paths with leading slashes. While a Trie could support wildcard searches, the problem specifically requests a Hash Map for direct path storage, making it the most straightforward and performant solution for these exact constraints. This approach demonstrates a deep understanding of data structure selection based on operational needs.