Implement a hierarchical key-value store

Q: Implement a hierarchical key-value store

This question evaluates implementation skills for hierarchical data structures, API design for a path-based key-value store, algorithmic time/space complexity reasoning, and considerations for testing, concurrency safety, and persistence in the Coding & Algorithms domain.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Implement an in-memory hierarchical key-value store where keys are UNIX-like paths joined by '/'. The root node is '/' with initial value '#'. Each node stores a string value. Support: (

Create(path, value): create a node; parent must exist; fail if the node already exists. (
SetValue(path, value): set the value; node must exist. (
GetValue(path): return the value; node must exist. (
Delete(path): delete the node only if it has no children; node must exist. Define the class interface, choose appropriate data structures, and provide time/space complexities. Include unit tests and discuss how you would add concurrency safety and optional persistence to disk.

Implement a hierarchical key-value store

Overview

Comments (0)