Harvey Coding Interview Questions

This Harvey interview question requires designing a simplified spreadsheet application capable of storing both raw numeric data and dynamic formulas. The task tests your algorithmic thinking and graph traversal skills by challenging you to handle cell references while actively detecting and preventing circular dependencies. You must carefully manage state updates and dependency tracking within a structured object-oriented framework. To view the comprehensive problem statement and verified model solution, a paid subscription is required.

In this coding challenge reported from Harvey, candidates must build a robust database connection pool utilizing a provided query mock. The exercise evaluates object-oriented design skills, concurrency management, and data structure usage by requiring the implementation of acquisition and release mechanisms for a fixed set of reusable connections. You will need to handle resource allocation safely under concurrent operations. Unlock the complete problem description and professional solution by purchasing a subscription.

This interview challenge, recently asked at Harvey, requires candidates to build a lightweight, hierarchical data storage utility mimicking a directory-based filesystem. The exercise evaluates your ability to handle standard file lifecycle operations, implement historical snapshots for state versioning, and design validation logic to compare synchronization across multiple storage instances. You will need to carefully manage path strings and maintain structural integrity throughout modifications. Unlock the complete problem description, architectural breakdown, and optimized model solution with a paid subscription.

Asked during a technical interview at Harvey, this problem challenges you to construct a miniature grid computation engine capable of managing cell values and simple arithmetic formulas. The task tests your expertise in dependency graph construction, topological sorting, and cycle detection to prevent recursive formula deadlocks. Implementing swift read operations while propagating updates through dependent cells requires careful architectural planning. Review the complete problem statement and professional model solution with a subscription.

This string-processing challenge, regularly utilized in technical interviews at Harvey, focuses on identifying and formatting specific lexical segments within generated prose based on external reference collections. The problem tests your aptitude for interval merging, text parsing, and hash-based lookups while handling overlapping regions and ranking frequencies. Unlock the complete problem context and optimal code implementation by subscribing.

This popular Harvey technical interview challenge asks you to build a simulated data hierarchy that supports directory navigation, file creation, and content retrieval using hierarchical naming paths. The exercise tests your proficiency with tree structures, custom parsing logic, and efficient in-memory data organization. Additional complexities involve handling duplicate naming conflicts and capacity limits within folders. Unlock the complete technical breakdown and expert solution by purchasing a subscription.

Compute the index that reports how many papers have at least that many citations each. This Harvey question is short and has two good answers worth comparing: sorting descending and walking until the condition fails, or counting into buckets for a linear solution. You will handle papers with no citations, note that the answer never exceeds the paper count, and state which approach you chose and why. A subscription unlocks the complete problem and the reference solution.