Katkat

practice a little every day, paws crossed ♡

Software Engineer 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 271–300 of 2629 results

  • Anchorage DigitalMediumSoftware Engineer
    Print the File System State

    This problem tests your ability to recursively traverse a tree structure and format the output into a specific, ordered directory-style string representation.

    Coding & AlgorithmsTechnical ScreenTrieRecursionTrees
  • 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
  • AndurilMediumSoftware Engineer
    Find Heap Objects Not Referenced by the Stack

    Implement a simplified mark-and-sweep sweep phase to identify unreferenced heap objects given a list of heap allocations and stack root pointers.

    Coding & AlgorithmsTechnical Screenhash-tablememory-managementarrays
  • AndurilMediumSoftware Engineer
    Find Unreachable Objects in a Heap Graph

    Implement a mark-phase reachability analysis for a heap graph starting from stack roots, returning unreachable heap addresses in their original order while handling cycles, self-references, and dangling pointers.

    Coding & AlgorithmsTechnical Screengraphsbfs-dfshash-table
  • AndurilMediumSoftware Engineer
    Maximize Profit From Cutting Rods

    This problem tests dynamic programming and optimization skills by requiring the calculation of the maximum profit obtainable from cutting a rod into integer-length pieces with given price values.

    Coding & AlgorithmsTechnical ScreenDynamic ProgrammingOptimizationAlgorithms
  • AnsysMediumSoftware Engineer
    Implement Prefix Search and Node Removal

    This question evaluates proficiency in string data structures and manipulation (prefix-search concepts including case-insensitive matching and regex-based normalization) as well as linked list pointer manipulation and in-place node removal.

    Coding & AlgorithmsTechnical Screen
  • 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
  • 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
  • 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
  • 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
  • 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