READ. UNDERSTAND. PRACTICE.
Interview questions
Explore algorithm tutorials, coding and system design questions, interview experiences, and computer science study guides.
1,290 resources · Page 39 of 54
Interview questions · Microsoft
Identify the Extra Directed Edge
This question evaluates understanding of graph theory concepts—directed trees, parent-child constraints, and cycle detection—and measures competency in reasoning about how a single extra directed edge can violate rooted-tree properties.
Interview questions · Meta
Identify trees, lists, and array search costs
This question evaluates knowledge of fundamental data structures (tree hierarchies, linear lists, and arrays), algorithmic time and space complexity, and cycle-detection concepts.
Interview questions · Amazon
Implement a formatted shell script output
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Implement a formatted shell script output states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Microsoft
Implement a generic tree Node class
This question evaluates skills in data structure and API design for mutable rooted trees, including node representation, parent/children management, iterator implementation (DFS/BFS), serialization/deserialization, cycle-safety, and time-complexity reasoning within the Coding & Algorithms domain.
Interview questions · Amazon
Implement a high-throughput web crawler safely
This question evaluates competency in concurrent systems, scalable data ingestion, and algorithmic design for a high-throughput web crawler, covering URL normalization, deduplication, per-host rate limiting, fault-tolerant checkpointing, and bounded-memory queueing.
Interview questions · Qualcomm
Implement A* Maze Search
This question evaluates proficiency in informed search algorithms, heuristic design (admissibility), grid-based graph traversal, path reconstruction, and time/space complexity analysis.
Interview questions
Implement a multi-button click detector
This question evaluates competency in real-time event stream processing, per-button state management, and timing-based classification of input events such as distinguishing single versus long presses.
Interview questions · Applied Intuition
Implement a nested object validator
This question evaluates proficiency in nested data validation, schema interpretation, and type checking for hierarchical objects, including handling nulls, arrays, extra fields, and clear error reporting.
Interview questions · NVIDIA
Implement a Python test harness
This interview question evaluates SQL or pandas logic, joins, grouping, window functions, null handling, edge cases, and validation in a realistic interview setting. A strong answer for Implement a Python test harness states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Amazon
Implement a robust shell CLI
This question evaluates proficiency in POSIX-compliant shell scripting, including positional argument parsing and validation, ISO 8601 UTC timestamp generation, file metadata extraction for license determination, construction of user@hostname, error handling and exit-code semantics, and handling of non-ASCII file paths.
Interview questions · DoorDash
Implement a simple service with tests
Implement a simple service with tests evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Bloomberg
Implement a simplified grep with extensible flags
This question evaluates competency in designing maintainable, extensible text-processing code, covering flag parsing, separation of concerns, and correct substring matching behavior.
Interview questions · Qube Research & Technologies
Implement a type-erased function wrapper
This question evaluates a candidate's understanding of C++ type erasure, callable wrappers, object lifetime and copy/move semantics, and exception-safety considerations when implementing a minimal std::function-like template.
Interview questions · Amazon
Implement ad matching and delivery routing
Implement ad matching and delivery routing evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Sybill
Implement an unbiased array shuffle
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Implement an unbiased array shuffle states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Credit Genie
Implement and analyze number-pattern function
This question evaluates algorithmic thinking and implementation skills related to string construction, time and auxiliary space complexity analysis, and handling boundary/edge-case off-by-one errors.
Interview questions · Cerebras
Implement and Optimize Vector Multiplication
This question evaluates a candidate's ability to implement vector–vector multiplication and to reason about performance optimizations and sparse data structures, assessing competencies in algorithm design, parallel computing, memory hierarchy, and numerical operations.
Interview questions · Bobyard
Implement comment sorting and nesting
This question evaluates skills in frontend data handling and UI behavior, including implementing sortable lists, maintaining user-selected sort field and direction across refreshes, constructing nested comment trees from flat parentId references, and filtering content while preserving descendant visibility.
Interview questions · Startups.Com
Implement common neural network layers in PyTorch
This question evaluates proficiency in implementing core neural-network primitives (ReLU, numerically-stable Softmax, LayerNorm, BatchNorm with running statistics, and RMSNorm), numerical stability and normalization concepts, and understanding of autograd-compatible tensor operations.
Interview questions · Coinbase
Implement Composable Range Iterators
This question evaluates understanding of iterator design, lazy evaluation, composable higher-order combinators (map, filter, zip, take, drop, chain), edge-case handling for forward/backward and negative-step ranges, overflow-safe termination, peekable semantics, iterator invalidation rules, and writing boundary-focused unit tests.
Interview questions · CloudKitchens
Implement concurrent order-accept/pickup simulator
This question evaluates concurrency and synchronization skills, including thread-safe design, inter-thread communication, state tracking, and correctness properties such as race-condition avoidance and deadlock freedom.
Interview questions · DoorDash
Implement consistent hashing ring
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Implement consistent hashing ring states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · NVIDIA
Implement core graph algorithms for graphics
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Implement core graph algorithms for graphics states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Snowflake
Implement crawler and bracket validator
This question evaluates competencies in web crawling and string validation, covering graph traversal and cycle avoidance with domain filtering for crawl discovery, and delimiter matching with error indexing for multi-type bracket validation.