Coding questions

1,899 resources · Page 26 of 80

1. Coding questions · Palo Alto Networks

   Design an O(1) eviction cache

   This question evaluates data structure and algorithmic design skills within the Coding & Algorithms domain, focusing on cache eviction policies and techniques for achieving average O(1) get/put operations. It is commonly asked to test reasoning about time and space complexity, handling of capacity and edge cases, and demonstrates a blend of conceptual understanding and practical application.

2. Coding questions · Meta

   Design an O(1) recency-evicting cache

   This question evaluates the ability to design an in-memory fixed-capacity cache that maintains access recency while delivering average O(1) get and put operations, focusing on data structure design, correctness of update semantics, and algorithmic time and space complexity analysis.

3. Coding questions · HubSpot

   Design and implement a bank account system

   This question evaluates a candidate's skills in system design, data modeling, transactional integrity, concurrency control, idempotency, API design, and algorithmic complexity for implementing a minimal banking service.

4. 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.

5. 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.

6. 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.

7. 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.

8. 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.

9. 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.

10. 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.

11. 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.

12. 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.

13. 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)).

14. 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.

15. 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.

16. 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.

17. 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.

18. 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.

19. 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.

20. 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.

21. 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.

22. 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.

23. 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.

24. 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.