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 541–570 of 2810 results

  • BloombergMediumSoftware Engineer
    Design a packet reassembler API

    This question evaluates API design, stream-oriented buffer management, stateful packet assembly, input validation, concurrency control, testing strategy, and time/space complexity reasoning.

    System DesignTechnical Screen
  • BloombergMediumSoftware Engineer
    Design an in-memory TODO list API

    This problem tests your ability to design a thread-safe, in-memory API for managing tasks, focusing on selecting efficient data structures for retrieval and update operations.

    Software Engineering FundamentalsTechnical ScreenAPI DesignConcurrencyHash Maps
  • BloombergMediumSoftware Engineer
    Design variable-size LRU cache

    This question evaluates understanding of cache design and eviction policies (LRU), management of variable-sized entries and memory budgeting, and the implementation of efficient data structures that support amortized O(1) access, updates and correct capacity accounting.

    Coding & AlgorithmsTechnical Screen
  • BloombergHardSoftware Engineer
    Detect Recent Duplicate Records with Bounded Memory

    Design a memory-bounded streaming duplicate detector that identifies repeated news/document records within a sliding time window and evicts expired content to prevent memory leaks.

    Coding & AlgorithmsTechnical ScreenSliding WindowHash TableQueue
  • BloombergMediumSoftware Engineer
    Determine Balloon Popping Time

    This problem tests your ability to model a grid-based propagation process as a shortest-path problem on a weighted graph, requiring an understanding of Dijkstra's algorithm or Breadth-First Search variants.

    Coding & AlgorithmsTechnical ScreenGraphBFSShortest Path
  • BloombergHardSoftware Engineer
    Explain Kafka partitions and delivery semantics

    This question evaluates understanding of distributed messaging and stream-processing concepts—specifically Kafka internals such as partitions, replication, consumer groups, and delivery semantics—and the candidate's competency in reasoning about ordering, scalability, fault tolerance, and transactional guarantees.

    System DesignTechnical Screen
  • BloombergMediumSoftware Engineer
    Find maximum cable length by cutting

    This question evaluates a candidate's proficiency in algorithm design, particularly applying binary search over a monotonic answer space and managing integer versus floating-point precision when maximizing piece length.

    Coding & AlgorithmsTechnical Screen
  • BloombergMediumSoftware Engineer
    Find the Lowest Common Ancestor of Two Nodes in an N-ary Tree

    Given a rooted tree whose nodes can have any number of children, stored as child lists, return the lowest common ancestor of two labeled nodes. The problem generalizes the binary-tree version to arbitrary fan-out and tests tree traversal, ancestor reasoning, and robust handling of very deep, path-shaped trees.

    Coding & AlgorithmsTechnical Screen
  • BloombergMediumSoftware Engineer
    Flag Fraudulent Transactions by Amount and Travel Time

    This problem tests your ability to use hash maps for efficient lookups and filtering collections based on conditional business logic.

    Coding & AlgorithmsTechnical ScreenHash MapsAlgorithmsData Structures
  • BloombergEasySoftware Engineer
    Generate the Collatz Sequence From a Positive Integer Down to 1

    Write a function that runs the Collatz process from a positive integer, halving even values and replacing odd values with three times the value plus one, and returns every number visited until reaching 1. It tests loop termination, edge cases such as a start of 1, and intermediate values beyond 32-bit range.

    Coding & AlgorithmsTechnical Screen
  • BloombergMediumSoftware Engineer
    Implement a simplified grep with extensible flags

    This question evaluates competency in designing maintainable, extensible text-processing code, covering flag parsing, separation of concerns, and correct substring matching behavior.

    Coding & AlgorithmsTechnical Screen
  • BloombergMediumSoftware Engineer
    Implement classes in existing abstract hierarchy

    This question evaluates object-oriented design and implementation skills in Python within the Coding & Algorithms and software engineering domain, focusing on completing concrete subclasses in an existing abstract class hierarchy while preserving public interfaces and type compatibility.

    Coding & AlgorithmsTechnical Screen
  • BloombergMediumSoftware Engineer
    Implement sliding-window timestamped average

    This question evaluates understanding of time-based sliding-window data structures, streaming aggregation, and the handling of timestamped records with efficient incremental updates and evictions.

    Coding & AlgorithmsTechnical Screen
  • BloombergMediumSoftware Engineer
    Implement streaming enrichment aggregator

    This problem tests your ability to design a stateful stream processor that aggregates fragmented event data based on a shared correlation ID within a sliding time window.

    Coding & AlgorithmsTechnical ScreenHashMapsStream ProcessingConcurrency
  • BloombergMediumSoftware Engineer
    Introduce yourself and explain why Bloomberg

    This question evaluates a candidate's communication, project ownership, technical decision-making, and motivation for joining the prospective employer, with emphasis on articulating specific contributions, trade-offs, and measurable impact.

    Behavioral & LeadershipTechnical Screen
  • BloombergMediumSoftware Engineer
    Minimize Travel Assignment Cost

    This problem tests your ability to minimize costs when assigning workers to multiple destinations, requiring an application of dynamic programming to manage fixed capacity constraints.

    Coding & AlgorithmsTechnical ScreenDynamic ProgrammingBitmaskingOptimization
  • BloombergMediumSoftware Engineer
    Minimum Character Replacements to Make One String an Anagram of Another

    Given two strings of equal length made of lowercase letters, find the fewest single-character replacements in the second string that turn it into an anagram of the first. This phone-screen coding problem tests character frequency counting and precise reasoning about which letters must change.

    Coding & AlgorithmsTechnical Screen
  • BloombergMediumSoftware Engineer
    Solve Magic Dictionary and unknown traversal

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve Magic Dictionary and unknown traversal states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsTechnical Screen
  • BloombergMediumSoftware Engineer
    Solve common string/tree/grid interview tasks

    This problem tests your ability to perform a vertical-order traversal of a binary tree by mapping nodes to relative column indices and sorting them by their depth and value.

    Coding & AlgorithmsTechnical ScreenTreesBFSSorting
  • BloombergEasySoftware Engineer
    Solve meeting and tree problems

    This problem tests your ability to manipulate overlapping intervals and perform specific tree traversals to extract structural information.

    Coding & AlgorithmsTechnical ScreenSortingIntervalsBinary Tree
  • BloombergMediumSoftware Engineer
    Solve sliding-window, flattening, decode, and O(1) random set

    This problem tests your ability to handle nested data structures through recursive parsing, maintain efficient state using hash maps and dynamic arrays, and implement sliding window techniques to manage constraints in a stream.

    Coding & AlgorithmsTechnical ScreenStackRecursionHash Map
  • BloombergMediumSoftware Engineer
    Solve string dictionary and tree ordering

    This question evaluates design and analysis skills for string-matching data structures that support one-edit queries and for binary tree traversal with coordinate-based ordering, testing understanding of data structures, search algorithms, sorting, and complexity analysis within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • BloombergMediumSoftware Engineer
    Validate whether brackets are properly nested

    This problem tests your ability to use a stack data structure to maintain LIFO ordering for matching paired symbols within a string.

    Coding & AlgorithmsTechnical ScreenStackStringData Structures
  • BnsfMediumSoftware Engineer
    Implement a rail freight quote API service layer and scale it for slow dependencies

    Given a REST API requirements document for a rail freight quote endpoint that depends on other services and a database, write the service-layer logic. Then design an architecture that keeps the endpoint fast and reliable under heavy traffic when its dependencies are slow, covering caching, timeouts, fallbacks and asynchronous quotes.

    Software Engineering FundamentalsTechnical Screen
  • BobyardMediumSoftware Engineer
    Build Nested Comments from Parent References

    This problem tests your ability to handle tree data structures, pointer manipulation, and graph validation while processing unordered flat data.

    Software Engineering FundamentalsTechnical ScreenTreesGraphsHash Maps
  • BobyardMediumSoftware Engineer
    Design a client-side comment system

    This question evaluates front-end engineering competencies including client-side data modeling, state management, UI behavior for nested comment trees, sorting/filtering semantics, and persistence using localStorage.

    System DesignTechnical Screen
  • BobyardMediumSoftware Engineer
    Design comments and async image generation

    This question evaluates full-stack system-design competencies, including CRUD API and data-model design for sortable queries with persisted user preferences, frontend-backend synchronization, and asynchronous long-running job orchestration, status/result APIs, and UI ordering for image generation; it falls under the System Design category and tests a mix of conceptual architectural reasoning and practical application design. It is commonly asked because it probes the ability to balance scalability, consistency, user experience, and fault-tolerant asynchronous processing when designing end-to-end systems that must handle persistence, ordering guarantees, and long-running background work.

    System DesignTechnical Screen
  • BobyardMediumSoftware Engineer
    How do you debug slowness and bugs?

    This question evaluates troubleshooting and incident-response competencies, including performance debugging, root-cause analysis, severity assessment, mitigation and impact reduction, stakeholder communication, and safe deployment practices for web applications.

    Software Engineering FundamentalsTechnical Screen
  • BobyardMediumSoftware Engineer
    Implement comment sorting and nesting

    This question evaluates skills in frontend data handling and UI behavior, including implementing sortable lists, maintaining user-selected sort field and direction across refreshes, constructing nested comment trees from flat parentId references, and filtering content while preserving descendant visibility.

    Coding & AlgorithmsTechnical Screen
  • BoeingEasySoftware Engineer
    Compute unique-substring length and first unique index

    This problem tests your ability to manage character frequency counts and sliding window techniques to identify properties of unique substrings and characters.

    Coding & AlgorithmsTechnical ScreenStringSliding WindowHash Map