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 451–480 of 2629 results

  • BitkernelHardSoftware Engineer
    Implement popup and redirect in JavaScript

    This question evaluates proficiency with client-side JavaScript, including browser APIs, DOM-based UI creation for popups, event handling, navigation mechanisms, and simple input validation for redirects.

    Coding & AlgorithmsOnline Assessment
  • BlackRockEasySoftware Engineer
    Design paint editor with undo/redo

    This question evaluates a candidate's ability to implement mutable state management, efficient data structures and algorithms for pixel operations (draw, erase, flood fill) alongside correct undo/redo history tracking and state consistency.

    Coding & AlgorithmsTechnical Screen
  • BlackRockMediumSoftware Engineer
    Implement sorting and set intersection with input parsing

    This question evaluates proficiency in algorithm design and implementation, specifically sorting algorithms, set intersection logic, input parsing, and analysis of time/space complexity and algorithm stability within the Coding & Algorithms domain.

    Coding & AlgorithmsOnline Assessment
  • BlackRockMediumSoftware Engineer
    Solve hierarchy distance and digit-square convergence

    This question evaluates understanding of tree and graph modeling, shortest-path reasoning, iterative function behavior and cycle detection, along with time and space complexity analysis within the Coding & Algorithms domain.

    Coding & AlgorithmsOnline Assessment
  • BloombergMediumSoftware Engineer
    Add Two Forward-Order Lists

    This problem tests your ability to perform manual addition on numbers represented by linked lists where the most significant digit comes first, requiring either stack-based reversal or recursive backtracking.

    Coding & AlgorithmsTechnical ScreenLinked ListMathStack
  • BloombergMediumSoftware Engineer
    Check equal character frequencies

    This problem tests your ability to use frequency mapping to determine if a string can be transformed into a state where all characters appear the same number of times through a single character removal.

    Coding & AlgorithmsTechnical ScreenStringHash MapFrequency Analysis
  • BloombergEasySoftware Engineer
    Compute meeting rooms and evaluate RPN

    This problem tests interval management using sorting and heap-like logic for resource allocation, combined with stack manipulation to evaluate mathematical expressions.

    Coding & AlgorithmsTechnical ScreenSortingHeapStack
  • BloombergMediumSoftware Engineer
    Count friend requests based on age rules

    This question evaluates algorithmic problem-solving skills involving array processing, counting and combinatorics under conditional constraints and frequency handling.

    Coding & AlgorithmsTechnical Screen
  • 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
    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 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
  • 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
    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
  • BloombergMediumSoftware Engineer
    Solve Number of Islands

    This question evaluates understanding of graph and grid traversal concepts, specifically identifying connected components in a binary matrix and familiarity with traversal strategies such as BFS and DFS.

    Coding & AlgorithmsOnsite
  • 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