Katkat

practice a little every day, paws crossed ♡

Coding & Algorithms Interview Questions

Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.

9403
Questions
546
Companies
11
Topics
8
Languages

Showing 91–120 of 1080 results

  • AmazonMediumSoftware Engineer
    Validate 9x9 grid in one pass

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Validate 9x9 grid in one pass states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsOnsite
  • AmperityMediumSoftware Engineer
    Render Overlapping Rectangles on an ASCII Canvas

    Render bordered and filled rectangles onto a fixed ASCII canvas, clipping safely and honoring input-order overwrites. Handle negative coordinates, fully hidden shapes, one-cell dimensions, trailing spaces, overlap behavior, and a canvas of up to one million cells.

    Coding & AlgorithmsOnsite
  • AmplitudeMediumSoftware Engineer
    Implement Employee Validation and Snake

    This question evaluates recursion, graph traversal and cycle-detection concepts for hierarchical employee validation alongside state management, event-driven input handling and collision detection for a grid-based Snake game.

    Coding & AlgorithmsOnsite
  • AndurilMediumSoftware Engineer
    Build a Dynamic Exact-Suffix Search Index

    Design an in-memory index that supports dynamically inserting words and checking whether any previously inserted word ends with a given suffix in time proportional to the suffix length.

    Coding & AlgorithmsOnsiteTrieStringData Structure Design
  • AndurilMediumSoftware Engineer
    Evaluate a Variadic Addition or Subtraction Expression

    Implement a variadic prefix expression evaluator supporting addition and left-associative subtraction with support for nested expressions and error handling.

    Coding & AlgorithmsOnsiteRecursionStackExpression Evaluation
  • AnthropicMediumSoftware Engineer
    Account Balance with Expiring Grants

    Design a data structure that tracks time-limited credit grants, prioritizes consuming grants that expire earliest, and efficiently manages expired funds.

    Coding & AlgorithmsOnsiteHeapGreedyDesign
  • AnthropicMediumSoftware Engineer
    Apply bitwise tricks for performance

    This question evaluates proficiency with bitwise operations, branchless programming, low-level performance optimizations, and microarchitectural reasoning about pipeline stalls, instruction-level parallelism, and cache behavior.

    Coding & AlgorithmsOnsite
  • AnthropicMediumSoftware Engineer
    Banking System Simulation

    This question evaluates a candidate's ability to design a stateful, multi-level simulation system that processes a time-ordered stream of operations. It tests object-oriented design, incremental complexity management, and handling of deferred effects like scheduled cashback credits. Such object-modeling questions are commonly used in coding interviews to assess practical application of data structures under evolving requirements.

    Coding & AlgorithmsOnsite
  • AnthropicHardSoftware Engineer
    Build a Progressive Banking Ledger

    Design and implement an in-memory, timestamped banking ledger supporting atomic transfers, cashback, scheduled payments, account merges with alias resolution, and historical balance lookups.

    Coding & AlgorithmsOnsitedesignheapbinary-search
  • AnthropicHardSoftware Engineer
    Build a Progressive Cloud Storage System

    Design and implement an in-memory cloud storage engine supporting user quotas, file operations, compression/restoration semantics, and glob-based search.

    Coding & AlgorithmsOnsiteData StructuresSystem DesignOOP
  • AnthropicHardSoftware Engineer
    Build a Progressive Employee Tracker

    Design an in-memory attendance and payroll tracking system that manages shift lifecycles, deferred rate promotions, overlapping bonus windows, and duration rankings.

    Coding & AlgorithmsOnsiteIntervalsBinary SearchObject-Oriented Design
  • AnthropicHardSoftware Engineer
    Build a least-recently-used cache

    This problem tests your ability to implement an efficient LRU cache using a combination of a hash map and a doubly linked list to achieve constant-time operations.

    Coding & AlgorithmsOnsiteData StructuresHash MapLinked List
  • AnthropicHardSoftware Engineer
    Calculate Streaming Token Usage Costs

    Implement a robust token usage billing manager that accumulates streaming chunk deltas and non-streaming totals, enforces strict schema and sanity checks, and avoids floating-point precision loss.

    Coding & AlgorithmsOnsiteAlgorithmsData StructuresSystem Design
  • AnthropicHardSoftware Engineer
    Compute Exclusive Time from Stack Events

    Compute aggregate exclusive execution time for each function from nested start and end events, including recursive calls. Use a stack over a validated single-threaded trace, apply half-open time intervals, and return deterministic sorted results.

    Coding & AlgorithmsOnsite
  • AnthropicHardSoftware Engineer
    Convert Sampled Call Stacks into Start and End Events

    Convert sampled call stacks to inferred start/end events using ordered common prefixes, recursive frames, explicit final-open behavior, and last-N history limitations.

    Coding & AlgorithmsOnsite
  • AnthropicHardSoftware Engineer
    Convert Stack Samples into Trace Events

    This problem tests your ability to manipulate tree-like path structures and manage state transitions using a stack, specifically focusing on efficiently calculating diffs between consecutive call stacks.

    Coding & AlgorithmsOnsiteArraysStackStrings
  • AnthropicMediumMachine Learning Engineer
    Convert State Stream to Events

    This question tests the ability to process a stream of state changes, group consecutive identical values into distinct event intervals, and filter these events based on duration.

    Coding & AlgorithmsOnsiteArraysData ProcessingAlgorithms
  • AnthropicMediumSoftware Engineer
    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 & AlgorithmsOnsite
  • AnthropicMediumSoftware Engineer
    Design file deduplication at scale

    This question evaluates understanding of file-system algorithms, hashing and deduplication techniques, scalable I/O and memory management, and correctness considerations for hash collisions, and it belongs to the Coding & Algorithms domain.

    Coding & AlgorithmsOnsite
  • AnthropicMediumSoftware Engineer
    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 & AlgorithmsOnsite
  • AnthropicMediumSoftware Engineer
    Detect duplicate files by content

    This question evaluates filesystem traversal, efficient I/O and memory use, hashing strategies for content comparison, duplicate-detection algorithms, and time/space complexity analysis.

    Coding & AlgorithmsOnsite
  • AnthropicMediumSoftware Engineer
    Find Duplicate Files

    This question evaluates a candidate's skills in file-system traversal, content deduplication strategies, hashing, large-file I/O handling, concurrency, and robustness to errors and file changes during scans.

    Coding & AlgorithmsOnsite
  • AnthropicHardSoftware Engineer
    Find Duplicate Files by Content

    This question evaluates the ability to parse file-system-style input, group files by identical content, and manage deduplication using appropriate data structures and algorithms.

    Coding & AlgorithmsOnsite
  • AnthropicMediumSoftware Engineer
    Find and remove duplicate files

    This question evaluates the ability to design scalable file deduplication algorithms, specifically testing knowledge of hashing strategies, collision handling, memory and I/O optimization, handling very large files, incremental/resumable operation, and complexity and trade-off analysis.

    Coding & AlgorithmsOnsite
  • AnthropicMediumSoftware Engineer
    Find the Slowest Function from Profiler Events

    This question evaluates the ability to interpret time-ordered profiler event logs, compute inclusive and exclusive function runtimes, reason about call-stack semantics, and recognize anomalies such as recursion, cycles, missing end events, or non-returning functions.

    Coding & AlgorithmsOnsite
  • AnthropicMediumSoftware Engineer
    Implement Parallel Image Processing

    This question evaluates competency in concurrent and parallel processing, practical image manipulation with Python libraries (Pillow), resource management for memory and file I/O, robust error handling, and performance measurement.

    Coding & AlgorithmsOnsite
  • AnthropicHardSoftware Engineer
    Implement Persistent Memoization LRU Cache

    This problem tests your ability to design a decorator that memoizes function results using an LRU policy while ensuring the cache survives process restarts via disk serialization.

    Coding & AlgorithmsOnsitePythonLRU CacheDecorator
  • AnthropicMediumSoftware Engineer
    Implement Python LRU cache with args and persistence

    This question evaluates a candidate's ability to design and implement an LRU cache in Python that supports variable-length positional and keyword arguments with canonical, deterministic hashing for semantically equivalent calls and O(1) get/put via a hash map plus a doubly linked list; it falls under the Coding & Algorithms domain and primarily tests practical implementation skills, API robustness, hashing/equality subtleties, and algorithmic complexity guarantees. The persistence follow-up evaluates understanding of serialization and storage design — on-disk formats, versioning, and atomic write strategies — and compares trade-offs between binary pickle and JSON-based serialization in terms of security, compatibility, and performance, reflecting both conceptual design and practical system-level considerations.

    Coding & AlgorithmsOnsite
  • AnthropicMediumSoftware Engineer
    Implement Python LRU cache with varargs

    This question evaluates a candidate's ability to implement an LRU caching mechanism in Python, including decorator design, argument canonicalization for positional args, *args, and **kwargs, handling unhashable inputs, eviction semantics, cache metadata operations (clear, cache_info), and JSON-based persistence and versioning.

    Coding & AlgorithmsOnsite
  • AnthropicMediumSoftware Engineer
    Implement a Banking System

    This question evaluates skills in designing and implementing a stateful in-memory banking system, covering account modeling, transfer lifecycle and expiration handling, balance management, and tracking aggregate outgoing amounts.

    Coding & AlgorithmsOnsite