Dcentralab interview questions

first round: Design an **Autocomplete System** that provides the **top 10 most-searched words** based on a given prefix. 1. **Insert a Word:** Utilize a **Trie** structure, storing words and their frequencies at the leaf nodes. 2. **Retrieve Suggestions:** Traverse the Trie for the prefix, then apply a **max-heap** to track the top 10 words by frequency. 3. **Time Complexity:** - **Insertion:** O(L), where L is the length of the word. - **Search:** O(P + K log K), where P is the length of the prefix and K is the number of suggestions. Example: For the prefix **"ap"**, suggestions may include: `apple (50)`, `app (40)`, `apricot (30)`, `application (20)`. high level design, without coding second round was to design a system that relates to blockchain, to fetch transaction from it and to find specific details in specific blocks, store it on a db and fetch it from there in future searches (not sure the interviewer was 100% sure about the specifications of the system)