← Harvey Interview Insights

Harvey·Software Engineer·Technical Phone Screen·Intermediate

Intermediate
May 2026

Summary

Did a technical phone screen for a Software Engineer role at HarveyAI. One coding question, finished fast, then sat through some awkward small talk for the rest of the slot.

Questions Asked (1)

Q1

Design and implement a file system.

System DesignAlgorithms & Data Structures
Author's notes

Recognized it immediately from the forums so I was able to move pretty quickly.

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

Start by clarifying requirements and scope, then design a hierarchical structure using a tree of nodes with inodes or similar, and finally implement core operations like create, read, write, delete, and list. Focus on trade-offs between simplicity and scalability, and discuss how to handle concurrency and persistence.

Pro tip: Demonstrate maturity by explicitly stating assumptions and asking clarifying questions about scale, consistency, and durability requirements before diving into design. Also, mention how you would test the file system, including edge cases like concurrent access and crash recovery.

1. Clarify Requirements

Ask questions to understand the scope: Is this a distributed file system or local? What are the expected scale, performance, and consistency requirements? What operations must be supported?

2. High-Level Design

Outline the core components: a hierarchical namespace (directories and files), metadata storage (inodes or similar), and data storage (blocks). Decide on a tree structure and how to map paths to nodes.

3. Detailed Design of Operations

Design algorithms for key operations: create, read, write, delete, list directory, and move/rename. Consider how to handle large files, sparse files, and efficient lookups.

4. Address Concurrency and Persistence

Discuss locking mechanisms for concurrent access, journaling or copy-on-write for crash consistency, and how to persist metadata and data to disk.

5. Scalability and Trade-offs

Analyze trade-offs: in-memory vs on-disk structures, block size, caching, and distributed extensions. Mention how to scale horizontally if needed.

Key Points to Mention

  • Hierarchical namespace with directories and files, using a tree structure
  • Inode-based metadata storage (permissions, timestamps, block pointers)
  • Block allocation strategies (contiguous, linked, indexed) and free space management
  • Concurrency control (locks, transactions) and crash consistency (journaling, COW)
  • Caching and buffering for performance
  • Testing strategies including unit tests, integration tests, and fault injection

AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.