Katkat

practice a little every day, paws crossed ♡

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 1621–1650 of 9403 results

  • 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
  • BlackRockMediumData Engineer
    Solve two interval array problems

    This question evaluates proficiency with array and interval-manipulation concepts—specifically sorting, merging overlapping ranges, and robust edge-case handling in interval operations.

    Coding & AlgorithmsTechnical Screen
  • BlackRockEasyProduct Manager
    Why BlackRock and Beyond Resume?

    Prepare for the Why BlackRock and Beyond Resume? interview question with a structured prompt, clarifying questions, answer rubric, follow-up probes, and a stronger model solution. This behavioral & leadership guide helps candidates frame assumptions, trade-offs, metrics, and role-relevant evidence without relying on generic answers.

    Behavioral & LeadershipTechnical Screen
  • BlinkHardSoftware Engineer
    Design a Support Ticket Processing System

    This question tests your ability to design a distributed, asynchronous ticket processing system that handles high volume, prioritizes SLAs, and ensures reliable data delivery.

    System DesignOnsiteScalabilityMessage QueuesDistributed Systems
  • Block (Square)MediumData Scientist
    Build referral chains and detect cycles

    This question evaluates graph algorithm competencies such as referral-chain traversal, cycle detection, handling noisy input data, and reasoning about time and space complexity for efficient per-node computation.

    Coding & AlgorithmsTechnical Screen
  • Block (Square)MediumData Scientist
    Write left-join queries with tricky filters

    This question evaluates SQL data-manipulation skills including LEFT JOIN semantics, aggregation functions like COUNT(DISTINCT) and SUM, GROUP BY/HAVING logic, and date-window filtering for referral and order analytics.

    Data Manipulation (SQL/Python)Technical Screen
  • 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
    Answer project and leadership behavioral questions

    This question evaluates leadership, project management, communication, reflection, conflict resolution, and task-allocation competencies within the Behavioral & Leadership domain for a software engineering role.

    Behavioral & LeadershipTechnical Screen
  • 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
    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