READ. UNDERSTAND. PRACTICE.
Prepare for your next interview.
Explore algorithm tutorials, coding and system design questions, interview experiences, and computer science study guides.
20,926 resources · Page 119 of 872
Coding questions · Anthropic
Design and implement a Python solution
This question evaluates Python programming proficiency, algorithm design, data structure selection and justification, modular coding practices, unit testing, and time/space complexity analysis.
Coding questions · Airbnb
Design and implement Connect Four engine
This question evaluates a candidate's competency in algorithmic problem solving, data structure selection, API design, complexity analysis, and testing through implementation of a Connect Four game engine.
Coding questions · Microsoft
Design cache with least-recently-used eviction
This question evaluates understanding of in-memory key–value cache design, eviction policies, and appropriate data-structure choices to achieve amortized O(1) get and put operations.
Coding questions · Apple
Design card deck with shuffle and order
This question evaluates understanding of data modeling and API design for a deck abstraction, algorithmic handling of randomization and sorting, and the ability to analyze time and space complexity.
Coding questions · Airbnb
Design Connect-N winner detector
This question evaluates data structure design and algorithmic optimization for grid-based game state management, including spatial reasoning required to detect n-in-a-row after a move.
Coding questions · Coinbase
Design crypto trading order control API
This question evaluates understanding of state management and finite-state machines, API design for lifecycle control, and implementation of in-memory data structures and transition validation in the Coding & Algorithms category.
Coding questions · DoorDash
Design dasher-to-order assignment algorithm
This question evaluates a candidate's skills in real-time algorithm design and systems thinking for dynamic matching and optimization, including scalability, time/space complexity analysis, and handling partial or delayed information.
Coding questions · Applied Intuition
Design duplicate-file detection using size
This question evaluates a candidate's understanding of filesystem metadata, scalable traversal algorithms, handling symlink and hard link edge cases, and memory/I/O trade-offs when grouping files by attributes such as size.
Coding questions · DoorDash
Design dynamic connectivity with alive nodes
This question evaluates understanding of dynamic graph data structures, connectivity algorithms, state management for node activation/deactivation, complexity analysis, and concurrent operation considerations.
Coding questions · Amazon
Design Efficient Data Structure for Median Retrieval
This question evaluates understanding of streaming data structures, median maintenance, and algorithmic complexity in the Coding & Algorithms domain by requiring efficient insertions (O(log n)) and constant-time median queries (O(1)).
Coding questions · Pinterest
Design Efficient Multi-Level Access Control System
This question evaluates understanding of hierarchical access control models, efficient path-based permission representation, and algorithmic design for fast membership checks.
Coding questions · Amazon
Design faster delay-time computation
This question evaluates a candidate's ability to design efficient array algorithms and appropriate data structures for nearest-smaller-element queries, assessing performance, correctness with duplicates, and scalability to large inputs.
Coding questions · Anthropic
Design file deduplication across nested directories
This question evaluates a candidate's competency in file system traversal, robust I/O handling including symbolic links and cycles, content-based deduplication, and algorithmic efficiency within the Coding & Algorithms domain.
Coding questions · Anthropic
Design high-throughput hashing for kernels
This question evaluates understanding of cache-efficient, high-throughput hash lookup design and related competencies such as hashing strategies, probe behavior, memory layout, vectorization, bitwise optimizations, prefetching, alignment, and microarchitectural performance trade-offs.
Coding questions · Amazon
Design idempotent daily loads with deduping
This question evaluates data engineering competencies including idempotent ETL design, deduplication and upsert semantics, handling late-arriving updates, partitioning and incremental watermarks, load auditing and data-quality checks using SQL and orchestration with Python.
Coding questions · Amazon
Design Incremental Load Process for Large Relational Table
This question evaluates understanding of incremental loading, change-data-capture, idempotent upsert logic, deduplication, partitioning, and data quality controls for large relational tables within the Data Manipulation (SQL/Python) domain.
Coding questions · Databricks
Design IP/CIDR rule matcher
This question evaluates understanding of IPv4 addressing, CIDR and numeric range representations, plus competency in designing efficient data structures and algorithms for low-latency rule matching with dynamic updates.
Coding questions · Meta
Design LCA and find K closest points
This question evaluates understanding of tree algorithms (LCA using parent pointers) and selection algorithms (sorting, max-heap, quickselect), emphasizing data structures, algorithmic correctness, and time/space complexity within the Coding & Algorithms domain.
Coding questions · Amazon
Design LCA with flexible inputs and rule
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Design LCA with flexible inputs and rule states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding questions · Amazon
Design LFU cache with distributed extension
This question evaluates understanding of cache design and frequency-based eviction policies, efficient data structures that support O(1) operations, and techniques for approximate frequency estimation and summarization in distributed streaming environments.
Coding questions · EY
Design logical model and consumption
This question evaluates understanding of logical data modeling, ERD-level design with keys and cardinalities, slowly changing dimensions, normalization versus denormalization trade-offs, and strategies for exposing curated datasets and read paths for analytics and regulatory consumers, indicating competency in data modeling and data delivery.
Coding questions · Snapchat
Design Manhattan-distance meeting point finder
This question evaluates algorithmic problem-solving and data-structure design skills for geometric aggregation problems, focusing on properties of Manhattan distance, handling dynamic updates, and analyzing time/space complexity within the Coding & Algorithms domain.
Coding questions · Stripe
Design metrics and write SQL for a case
This question evaluates the ability to define time‑bounded, attributable conversion metrics and to implement joins, aggregations, and diagnostic checks in SQL to measure marketing outreach impact.
Coding questions · Airbnb
Design mutable sum-tree with fast queries
This question evaluates proficiency in designing dynamic data structures for mutable rooted trees, including maintenance of subtree sums, parent/child link management, and analysis of update and query complexities within the Coding & Algorithms domain; it emphasizes practical application of algorithmic design coupled with conceptual understanding of invariants and amortized complexity. It is commonly asked in technical interviews because it probes reasoning about correctness and performance under mutations, handling edge cases such as subtree deletion and reattachment, and the ability to specify algorithmic approaches and complexity guarantees rather than implementation details.