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 1141–1170 of 5874 results

  • BloombergMediumSoftware Engineer
    Count islands by requested sizes

    This problem tests your ability to use graph traversal (DFS/BFS) to identify connected components in a grid and efficiently query their sizes using frequency maps.

    Coding & AlgorithmsTechnical ScreenGraphsDFSGrid
  • BloombergHardSoftware Engineer
    Describe leading an end-to-end client project

    This question evaluates leadership, client‑facing project management, requirements elicitation, scope negotiation, stakeholder communication, and maintainability practices within full‑stack software delivery.

    Behavioral & LeadershipTechnical Screen
  • BloombergMediumSoftware Engineer
    Design A Real-Time VWAP Analytics Provider

    Tests the ability to design an ultra-low-latency, stateful streaming pipeline that ingests heterogeneous market data feeds, maintains running volume-weighted aggregates, handles trade adjustments, and serves high-throughput subscriber fanout.

    System DesignTechnical ScreenStream ProcessingLow LatencyFinancial Systems
  • BloombergMediumSoftware Engineer
    Design a Card Deck with Shuffling, Dealing, and Five-Card Poker Comparison

    Design an object-oriented card deck with unbiased shuffling, atomic dealing, and complete five-card poker rankings, kickers, ace-low straights, and ties.

    Software Engineering FundamentalsTechnical Screen
  • BloombergHardSoftware Engineer
    Design a data structure for dynamic top‑K frequency

    This question evaluates data structure and algorithm design skills, focusing on frequency counting, dynamic maintenance of top-K elements, and efficient update and query operations in a multiset within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • BloombergMediumSoftware Engineer
    Design a fair event registration queue API

    This question tests the ability to design a thread-safe, high-concurrency registration system that handles FIFO ordering, capacity constraints, and efficient cancellation operations.

    System DesignOnsiteConcurrencyData StructuresAPI Design
  • 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 in-memory trade subscription processor

    This question evaluates a candidate's ability to design concurrent, high-throughput in-memory subscription matching systems, covering skills in data structure selection, algorithmic complexity analysis, and concurrency control.

    System DesignOnsite
  • BloombergHardSoftware Engineer
    Design streaming mention analytics with search and alerts

    This question tests the ability to design a distributed, low-latency streaming pipeline that aggregates mention counts for entities, provides search capabilities, and triggers alerts based on configurable thresholds.

    System DesignOnsiteDistributed SystemsStream ProcessingReal-time Analytics
  • 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
  • BloombergMediumSoftware Engineer
    Generate all strings by expanding wildcards

    This question evaluates algorithmic string manipulation and combinatorial enumeration skills, focusing on handling wildcard characters and generating all possible binary outcomes from a pattern.

    Coding & AlgorithmsOnsite
  • 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 island counting with BFS and DFS

    A Bloomberg Software Engineer onsite coding question: count the number of islands (connected land regions) in an m x n grid under four-directional connectivity. It asks for a linear-time O(m·n) flood-fill plus a second, explicit breadth-first-search implementation, with correctness and complexity analysis, edge-case handling, tests, and a diagonal-adjacency follow-up.

    Coding & AlgorithmsOnsite
  • 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
    Predict most likely next word from training data

    This problem tests your ability to process textual data into an N-gram model, requiring efficient counting of sequence frequencies to predict the most probable subsequent word.

    Coding & AlgorithmsOnsiteHash MapsNLPData Structures
  • BloombergMediumSoftware Engineer
    Solve Grid Path and Unique Substring

    This problem tests grid traversal via dynamic programming or recursion, combined with the sliding window technique to identify unique character patterns within string segments.

    Coding & AlgorithmsOnline AssessmentDynamic ProgrammingSliding WindowGrid
  • 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