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 931–960 of 3276 results

  • DatabricksMediumSoftware Engineer
    Solve Grid Path and Graph Sampling

    This question tests the ability to solve a shortest-path problem with multiple constraints using Dijkstra's algorithm, followed by understanding sampling techniques for connected graph structures.

    Coding & AlgorithmsTechnical ScreenDijkstraGraph AlgorithmsDynamic Programming
  • DatabricksMediumSoftware Engineer
    Solve graph path, interval deletion, and robbery

    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 graph path, interval deletion, and robbery states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsHR Screen
  • DatabricksMediumSoftware Engineer
    Tic-Tac-Toe Against a Deterministic Automatic Opponent

    Build an automated Tic-Tac-Toe opponent with perfect-play minimax, deterministic move ties, board events, invalid attempts, and terminal-state handling.

    Coding & AlgorithmsOnsite
  • DatabricksMediumSoftware Engineer
    Tic-Tac-Toe with Automatic Turns and Board Snapshots

    Implement two-player Tic-Tac-Toe with automatic turn changes, board snapshots, rejected moves, winning lines, and full-board draws.

    Coding & AlgorithmsOnsite
  • DatadogMediumSoftware Engineer
    Build span trees from unordered trace spans

    This problem tests your ability to reconstruct a parent-child hierarchical tree from an unordered collection of trace spans by leveraging parent ID references and sorting mechanisms.

    Coding & AlgorithmsTechnical ScreenTreesHash MapsSorting
  • DatadogMediumSoftware Engineer
    Compute sliding window sums by tag

    This question evaluates understanding of sequence processing, sliding-window aggregation, filtering by tag, and efficient state management in tagged time-series or event data, testing algorithmic efficiency and correctness.

    Coding & AlgorithmsOnsite
  • DatadogHardSoftware Engineer
    Implement Prefix Match Filter

    This question evaluates understanding of prefix-based string matching, data structure design (hash-based sets and trie/prefix tree), and algorithmic competencies including efficient in-memory storage and deduplication of matches.

    Coding & AlgorithmsOnsite
  • DatadogMediumSoftware Engineer
    Implement a Snowflake Query Client

    This question evaluates API client design, asynchronous query lifecycle management, result retrieval, robust error handling, and secure credential handling for a cloud data warehouse.

    Coding & AlgorithmsOnsite
  • DatadogEasySoftware Engineer
    Implement buffered file writer with concurrency support

    This question evaluates a candidate's ability to implement buffered I/O and design concurrency-safe APIs, exercising skills in data buffering, performance optimization, and thread-safety.

    Coding & AlgorithmsTechnical Screen
  • DatadogMediumSoftware Engineer
    Implement log storage and querying

    This question evaluates a candidate's skill in designing and analyzing log storage and query systems, covering data layout, indexing strategies, time-range scans with optional filters, and time/space complexity reasoning.

    Coding & AlgorithmsTechnical Screen
  • DatadogMediumSoftware Engineer
    Implement write with internal buffer

    This question evaluates proficiency with buffered I/O, buffer management, memory handling, and performance optimization, including maintaining byte order, handling partial writes, and edge cases across consecutive write/flush/close operations.

    Coding & AlgorithmsTechnical Screen
  • DatadogMediumSoftware Engineer
    Match logs to prior queries

    This question evaluates understanding of streaming algorithms, string indexing, and set-based matching, focusing on designing efficient online data structures to match stored queries against incoming logs within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • DecagonMediumSoftware Engineer
    Compute exclusive CPU time from nested logs

    This question evaluates the ability to interpret execution logs and compute exclusive CPU time, testing skills in parsing structured logs, reasoning about nested execution intervals, and precise time accounting.

    Coding & AlgorithmsTechnical Screen
  • DecagonHardSoftware Engineer
    Count Legal Tic-Tac-Toe Games from the Empty Board

    Implement an exhaustive search algorithm to count all distinct legal game sequences in 3x3 Tic-Tac-Toe, categorized by outcome.

    Coding & AlgorithmsTechnical ScreenBacktrackingDFSGame Theory
  • DecagonMediumSoftware Engineer
    Design a Tic-Tac-Toe Engine

    This problem tests your ability to design a state-tracking system for an n x n Tic-Tac-Toe board that allows for constant-time move validation and win detection.

    Coding & AlgorithmsTechnical ScreenAlgorithmsData StructuresDesign
  • DecagonEasySoftware Engineer
    Design rolling-window conversation score tracker

    Design a rolling-window tracker for streaming conversation scores that supports score updates, rolling average calculation, and maximum score queries.

    Coding & AlgorithmsTechnical ScreenSliding WindowDesignQueue
  • DecagonMediumSoftware Engineer
    Enumerate 4x4 Tic-Tac-Toe Games

    This question evaluates understanding of recursion and backtracking, exhaustive game-tree enumeration, and state representation for combinatorial game analysis.

    Coding & AlgorithmsOnsite
  • DecagonMediumSoftware Engineer
    Implement CSAT tracking and call timing

    This problem tests your ability to manage stateful data during event processing and calculate exclusive execution times from a stream of nested function logs.

    Coding & AlgorithmsOnsiteStackSimulationData Structures
  • DecagonEasySoftware Engineer
    Implement a CSAT Sliding Window Tracker

    This question evaluates the ability to design and implement efficient data structures and algorithms for a sliding time-window tracker, covering time-based expiration, stateful updates, rolling averages with rounding, and nearest-rank percentile computation.

    Coding & AlgorithmsTechnical Screen
  • DeshawMediumMachine Learning Engineer
    Implement sqrt and parity-based array rearrangement

    In the Coding & Algorithms domain, this prompt evaluates numerical methods and precision handling for implementing a square-root function without library support, together with in-place array manipulation, partitioning and complexity reasoning for parity-based rearrangement, testing competencies in algorithm design, numerical approximation, and space-efficient data transformations. These problems are commonly asked to assess understanding of numerical stability, error bounds and iterative approximation as well as mastery of in-place ordering/partitioning strategies and time/space complexity analysis, requiring both conceptual understanding of mathematical properties and practical implementation ability.

    Coding & AlgorithmsTechnical Screen
  • DeshawMediumSoftware Engineer
    Maximum L1 Distance Between Equal-Length Subarrays

    Tests recognizing that non-negative L1 terms allow reducing subarray search to full diagonal overlaps across two arrays, requiring O(n * m) time and 64-bit integer handling.

    Coding & AlgorithmsTechnical Screenarraysmathtwo-pointers
  • Deutsche BankHardSoftware Engineer
    Solve tree equality and valid parentheses

    This problem set evaluates core skills in data structures and algorithmic reasoning, specifically binary tree structural equality and bracket-matching for strings, testing understanding of tree traversal, recursion, and stack-based parsing.

    Coding & AlgorithmsOnsite
  • DiscordMediumData Scientist
    Count a Character in a String

    Count case-sensitive occurrences of a character in a string, including empty input and repeated matches.

    Coding & AlgorithmsTechnical Screen
  • DiscordHardSoftware Engineer
    Implement User Sessionization From Event Stream

    This question evaluates proficiency in stream processing, stateful sessionization, time-based aggregation, and per-user metric computation, focusing on competencies such as tracking user activity across unbounded ordered event streams and computing top-channel aggregates.

    Coding & AlgorithmsTechnical Screen
  • DiscordMediumSoftware Engineer
    Implement an asyncio-based chat server

    This question tests practical knowledge of Python's asyncio library and concurrent programming by requiring the implementation of a TCP chat server. It evaluates a software engineer's ability to manage multiple simultaneous connections, handle resource cleanup, and apply event-driven concurrency patterns — core competencies commonly assessed in backend and systems-focused interviews.

    Coding & AlgorithmsOnsite
  • DiscordMediumData Scientist
    Return Words Present in Exactly One Message

    Find words appearing in exactly one of two messages using set symmetric difference while clarifying tokenization and case rules.

    Coding & AlgorithmsTechnical Screen
  • DisneyMediumData Engineer
    Generate All Valid Combinations of Balanced Parentheses

    This question tests a candidate's ability to apply recursive backtracking and combinatorial generation in a coding interview context. It evaluates understanding of constraint-based enumeration and string construction, core algorithmic skills frequently assessed in software engineering and data engineering roles.

    Coding & AlgorithmsOnline Assessment
  • DisneyMediumData Engineer
    Generate All Well-Formed Parenthesis Strings

    This question tests practical understanding of recursion and backtracking through enumeration of all valid parenthesis combinations of a given length. It is a classic coding interview problem that evaluates combinatorial reasoning, constraint-based pruning, and familiarity with Catalan number sequences in algorithm design.

    Coding & AlgorithmsOnline Assessment
  • DisneyMediumSoftware Engineer
    Implement an LRU cache

    This problem tests your ability to design a cache that supports O(1) access, insertion, and eviction by combining two core data structures.

    Coding & AlgorithmsOnsiteHash TableDoubly Linked ListDesign
  • DisneyMediumSoftware Engineer
    Solve grid shortest path with BFS

    This question evaluates understanding of grid traversal and shortest-path graph search, including modeling a 2D grid with obstacles and reasoning about boundary and edge cases, within the Coding & Algorithms domain.

    Coding & AlgorithmsOnsite