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 331–360 of 3276 results

  • 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
  • AnthropicMediumSoftware Engineer
    Build a concurrent web crawler

    This question tests your ability to design a concurrent crawler that manages shared state across multiple threads, handles URL de-duplication, and prevents infinite cycles during graph traversal.

    Coding & AlgorithmsTechnical ScreenConcurrencyMultithreadingGraph Traversal
  • 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
  • AnthropicMediumSoftware Engineer
    Compute exclusive times and call stack from logs

    This question evaluates a candidate's ability to process single-threaded execution logs and compute per-function exclusive durations while reconstructing the call stack at a given timestamp, testing stack simulation, interval reasoning, timestamp tie-handling, parsing of time-stamped events, and algorithmic complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • AnthropicMediumSoftware Engineer
    Compute matrix trace and support updates

    This question evaluates proficiency in matrix manipulation, incremental updates, and complexity analysis, specifically maintaining main-diagonal and anti-diagonal sums under point updates.

    Coding & AlgorithmsTechnical Screen
  • 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
  • AnthropicMediumMachine Learning Engineer
    Convert Samples into Event Intervals

    This problem tests your ability to process sequential data, apply run-length encoding concepts, and implement filtering logic based on temporal constraints.

    Coding & AlgorithmsTechnical ScreenArrayIntervalsData Processing
  • 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
  • AnthropicHardSoftware Engineer
    Convert Streaming Call-Stack Samples into Function Events

    Tests the ability to process discrete call-stack snapshots into properly nested, ordered function start and end events using longest common prefix analysis and stack unwinding.

    Coding & AlgorithmsTechnical Screenstackalgorithmsprofiling
  • AnthropicMediumMachine Learning Engineer
    Convert stack samples to execution trace

    This question evaluates understanding of sampled stack traces, event reconstruction, handling ambiguous or incomplete profiling data, and algorithmic reasoning about correctness and time/space complexity.

    Coding & AlgorithmsTechnical Screen
  • AnthropicHardSoftware Engineer
    Crawl Same-Domain Links

    This question evaluates understanding of web crawling and link traversal algorithms, including URL normalization, same-domain filtering, deduplication, and cycle-safe graph traversal.

    Coding & AlgorithmsTechnical Screen
  • AnthropicMediumSoftware Engineer
    Design a single- and multi-threaded web crawler

    This question evaluates skills in web crawling, URL parsing and fragment sanitization, graph traversal for deduplication, and concurrent programming for thread-safe crawling, and it falls under the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • 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 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 & AlgorithmsTechnical Screen
  • 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
  • AnthropicHardSoftware Engineer
    Design stack with O(1) minimum query

    This problem tests your ability to augment a standard stack with metadata to perform efficient minimum queries without sacrificing the constant-time complexity of stack operations.

    Coding & AlgorithmsTechnical ScreenStackData StructuresAlgorithms
  • 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
    Detect n-length consecutive sequences

    This question evaluates a candidate's competency in algorithm design and data-structure reasoning for detecting n-length consecutive integer sequences, encompassing handling of duplicates, negative values, and dynamic insertions and deletions.

    Coding & AlgorithmsTechnical Screen
  • AnthropicMediumSoftware Engineer
    Detect runs and answer suffix queries

    This question evaluates proficiency in array processing, run-length detection, algorithmic complexity analysis, and the use of range/suffix data structures within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • 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
  • AnthropicHardSoftware Engineer
    Find duplicate files and apply image operations

    This question evaluates skills in string parsing and content-based grouping for duplicate file detection, along with matrix manipulation for image operations like horizontal flips and box blur, covering competencies in algorithm design, data-structure selection, and numerical array transformations.

    Coding & AlgorithmsTechnical Screen