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 361–390 of 3276 results

  • 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
    Fix a Corrupted Bootloader Instruction

    Simulate a virtual machine's instruction set, detect an infinite loop cycle, and find the single instruction modification (between jmp and nop) that allows the program to terminate normally.

    Coding & AlgorithmsTechnical Screensimulationgraphdepth-first-search
  • AnthropicMediumSoftware Engineer
    Generate Function Profiling Events from Stack Samples

    Generate function start and end events from timestamped stack samples, including independently debounced frames across consecutive samples. Address transient appearances and absences, changing stack suffixes, shared timestamps, deep stacks, end-of-input behavior, complexity, and online processing.

    Coding & AlgorithmsTechnical Screen
  • AnthropicMediumSoftware Engineer
    Generate outputs for images and pipelines

    This question evaluates algorithmic and systems engineering skills related to batch image processing, parallelization, I/O versus CPU trade-offs, and deterministic output association within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • 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 Task Management and Duplicate Detection

    This problem tests your ability to design an in-memory task management system with concurrency-aware state tracking and implement an efficient file-deduplication routine using hashing.

    Coding & AlgorithmsTechnical ScreenData StructuresHashingConcurrency
  • 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
  • AnthropicMediumSoftware Engineer
    Implement a Batch Image Processor

    Design and implement an in-memory image transformation engine that applies sequential operations (grayscale, brightness scaling, nearest-neighbor resizing) over a batch of images efficiently.

    Coding & AlgorithmsTechnical ScreenParallelismMultiprocessingImage Processing
  • AnthropicMediumSoftware Engineer
    Implement a Least-Recently-Used Cache

    This question evaluates a candidate's ability to design and implement an efficient in-memory cache with eviction behavior, testing understanding of data structure selection, state management, and time/space complexity under capacity constraints.

    Coding & AlgorithmsOnsite
  • AnthropicHardSoftware Engineer
    Implement a Longest-Match Tokenizer

    Design and implement a greedy longest-match text tokenizer that validates vocabulary, supports configurable unknown-token coalescing, and emits token IDs alongside their exact substring matches.

    Coding & AlgorithmsOnsitetriestringnlp
  • AnthropicMediumSoftware Engineer
    Implement a Parallel Image Processor

    Design and implement a concurrent batch image processor that executes a sequence of matrix transforms across worker threads or processes while isolating per-job failures.

    Coding & AlgorithmsTechnical Screenconcurrencymultithreadingfault-tolerance
  • AnthropicHardMachine Learning Engineer
    Implement a Simplified DNS Resolver

    Implement an in-memory DNS resolver supporting A and CNAME record lookups, domain name normalization, TTL expiration, and CNAME alias chain cycle detection.

    Coding & AlgorithmsOnline AssessmentHash TableGraphDesign
  • AnthropicHardSoftware Engineer
    Implement a Time-Aware Task Manager

    Design an in-memory task manager supporting per-user task versioning, time-to-live (TTL) expiration, and point-in-time historical queries.

    Coding & AlgorithmsTechnical ScreenBinary SearchData StructuresDesign
  • AnthropicHardSoftware Engineer
    Implement a hierarchical file store

    This problem tests your ability to design a hierarchical file system data structure and implement operations for directory traversal, file manipulation, and path normalization.

    Coding & AlgorithmsOnsiteTreeTrieData Structures
  • AnthropicMediumMachine Learning Engineer
    Implement a web crawler using a provided API

    This problem tests your ability to design a multi-threaded web crawler that efficiently traverses a site while respecting domain constraints and avoiding redundant work.

    Coding & AlgorithmsOnsiteConcurrencyGraph TraversalBFS
  • AnthropicMediumMachine Learning Engineer
    Implement an extensible prefix tree

    This question evaluates the ability to design and implement an extensible prefix tree (trie), covering competencies in Unicode-aware string handling, memory and time optimization, concurrency or thread-safety considerations, and support for operations like insert, search, startsWith, countPrefix and erase.

    Coding & AlgorithmsOnsite
  • AnthropicMediumSoftware Engineer
    Implement an in-memory DB with TTL backup/restore

    Implement an in-memory nested key-value store supporting field-level time-to-live (TTL) expiration and snapshot backup/restore operations.

    Coding & AlgorithmsOnline Assessmentdata-structuresdesignhash-map
  • AnthropicMediumMachine Learning Engineer
    Implement cluster status tracker

    This question evaluates a candidate's competence in data structures and algorithms for time-ordered state tracking, time-series indexing, conflict resolution (last-write-wins), memory-efficient storage, and concurrent system behavior under high update rates.

    Coding & AlgorithmsTechnical Screen
  • AnthropicMediumSoftware Engineer
    Implement crawler, dedup, and persistent LRU

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Implement crawler, dedup, and persistent LRU states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsOnsite
  • AnthropicMediumSoftware Engineer
    Implement file deduplication at scale

    Implement streaming file deduplication that filters by size, fingerprint and hash, then compares bytes to rule out hash collisions. It covers large-file chunking, batched disk I/O, parallelizing across cores or machines, a dry-run report, and hard links that never cross devices. Follow-ups turn it into a command-line tool that handles symbolic links, unreadable files, error cases, and options to move or delete duplicates.

    Coding & AlgorithmsOnsite
  • AnthropicMediumSoftware Engineer
    Implement hostname-restricted web crawler

    This question evaluates skills in graph traversal and cycle detection, hostname-based filtering, URL parsing, and basic network error handling. Commonly asked in Coding & Algorithms interviews, it assesses algorithmic reasoning about traversal strategy and complexity (time and space) analysis while balancing conceptual understanding with practical implementation details.

    Coding & AlgorithmsTechnical Screen
  • AnthropicHardSoftware Engineer
    Implement staircase printing and distributed mode/median

    This set of problems evaluates implementation correctness and attention to formatting for a staircase-printing routine alongside distributed-algorithms reasoning for computing a global mode/median, testing algorithmic thinking, I/O handling, synchronization, and communication-cost trade-offs in the Coding & Algorithms domain.

    Coding & AlgorithmsOnsite
  • AnthropicMediumSoftware Engineer
    Implement thread-safe blocking queue

    This question evaluates competency in concurrent programming, synchronization primitives, and implementation of thread-safe bounded blocking queues within the Coding & Algorithms domain.

    Coding & AlgorithmsOnsite
  • AnthropicMediumSoftware Engineer
    In-Memory Key-Value Database with Nested Transactions

    Design an in-memory key-value store supporting nested transactions with begin, commit, rollback, get, set, and delete operations.

    Coding & AlgorithmsOnsiteData StructuresStackDesign
  • AnthropicMediumSoftware Engineer
    LRU Cache

    This question tests the ability to combine a hash map and a doubly linked list to implement an LRU cache with O(1) performance for both get and put operations.

    Coding & AlgorithmsOnsiteHash MapDoubly Linked ListDesign
  • AnthropicMediumSoftware Engineer
    Path Resolution with Symbolic Links

    Implement a filesystem path resolution function that normalizes paths containing '.', '..', and symbolic links while detecting cycles.

    Coding & AlgorithmsOnsitestring parsingstacksimulation
  • AnthropicMediumSoftware Engineer
    Same-Domain Web Crawl (BFS)

    Implement a breadth-first search crawler that traverses pages starting from a seed URL, filtering for pages sharing the same domain and properly deduplicating visited URLs.

    Coding & AlgorithmsOnsitebfsgraphstring-parsing