File System - Amazon Top Interview Questions


Problem Statement :


Implement a data structure with the following methods:

bool create(String path, int content) which creates a path at path if there's a parent directory and path doesn't exist yet, and sets its value as content. Returns whether it was newly created. Initially only the root directory at "/" exists.
int get(String path) which returns the value associated with path. If there's no path, return -1.
Constraints

0 ≤ n ≤ 100,000 where n is the number of calls to create and get

Example 1

Input

methods = ["constructor", "create", "create", "get", "get", "create", "get"]
arguments = [[], ["/usr", 1], ["/usr/bin", 2], ["/usr"], ["/usr/bin"], ["/proc/1/exe", 3], ["/non/existent"]]`

Output

[None, True, True, 1, 2, False, -1]

Explanation

fs = FileSystem() # Only "/" exists
fs.create("/usr", 1) == True # Now "/" and "/usr" exists
fs.create("/usr/bin", 2) == True# Now "/", "/usr" and "/usr/bin" exists
fs.get("/usr") == 1
fs.get("/usr/bin") == 2
fs.create("/proc/1/exe", 3) == False # Parent dir "/proc/1/" doesn't exist, so can't create here
fs.get("/non/existent") == -1


Solution :



title-img 




                        Solution in C++ :

struct Node {
    string folderName;
    int content;
    unordered_map<string, Node*> children;
    Node(string name, int c) {
        folderName = name;
        content = c;
        children.clear();
    }
};

class FileSystem {
    private:
    Node* root;
    vector<string> getFolders(string path) {
        path = path.substr(1);
        vector<string> folders;
        string temp = "";

        for (int i = 0; i < path.size(); i++) {
            if (path[i] != '/') {
                temp.push_back(path[i]);
            } else {
                folders.push_back(temp);
                temp = "";
            }
        }
        if (temp != "") folders.push_back(temp);
        return folders;
    }

    bool createHelper(string path, int content) {
        vector<string> folders = getFolders(path);
        bool newlyCreated = false;

        // cout<<"CREATE"<<endl;
        // for(auto x: folders)
        //     cout<<x<<" ";
        // cout<<endl;

        int ptr = 0;
        Node* currentNode = root;
        while (ptr < folders.size()) {
            if (currentNode->children.find(folders[ptr]) != currentNode->children.end()) {
                // cout<<"ALREADY HERE "<<folders[ptr]<<endl;
                currentNode = currentNode->children[folders[ptr]];
            } else {
                // cout<<"NEW HERE "<<folders[ptr]<<endl;
                if (ptr != folders.size() - 1) return false;
                newlyCreated = true;
                Node* node = new Node(folders[ptr], content);
                currentNode->children[folders[ptr]] = node;
                currentNode = node;
            }
            ptr++;
        }
        // cout<<endl<<endl;
        return newlyCreated;
    }
    int getHelper(string path) {
        vector<string> folders = getFolders(path);
        Node* currentNode = root;

        int ptr = 0;
        while (ptr < folders.size()) {
            if (currentNode->children.find(folders[ptr]) == currentNode->children.end()) return -1;
            currentNode = currentNode->children[folders[ptr]];
            ptr++;
        }
        return currentNode->content;
    }

    public:
    FileSystem() {
        root = new Node(".root", -1);
    }

    int get(string path) {
        return getHelper(path);
    }

    bool create(string path, int content) {
        return createHelper(path, content);
    }
};
                    




                        Solution in Python : 
                            
class FileTree:
    def __init__(self):
        self.children = {}
        self.value = None


class FileSystem:
    def __init__(self):
        self.tree = FileTree()
        self.tree.children[""] = FileTree()

    def insert(self, pathList, content):
        temp = self.tree
        for idx, path in enumerate(pathList):
            if path not in temp.children:
                if idx < len(pathList) - 1:
                    return False
                temp.children[path] = FileTree()
            temp = temp.children[path]
        if temp.value != None:
            return False
        temp.value = content
        return True

    def get(self, path):
        temp = self.tree
        for path in path.split("/"):
            if path not in temp.children:
                return -1
            temp = temp.children[path]
        return temp.value if temp.value != None else -1

    def create(self, path, content):
        return True if self.insert(path.split("/"), content) else False


View More Similar Problems

Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →

Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

View Solution →

Kundu and Tree

Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that

View Solution →

Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →

Contacts

We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co

View Solution →

No Prefix Set

There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio

View Solution →