Coding & Algorithms interview questions

Showing 931–960 of 3276 results

• Solve Grid Path and Graph SamplingMedium

  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.

  DatabricksSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve graph path, interval deletion, and robberyMedium

  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.

  DatabricksSoftware EngineerCoding & AlgorithmsHR Screen
• Tic-Tac-Toe Against a Deterministic Automatic OpponentMedium

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

  DatabricksSoftware EngineerCoding & AlgorithmsOnsite
• Tic-Tac-Toe with Automatic Turns and Board SnapshotsMedium

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

  DatabricksSoftware EngineerCoding & AlgorithmsOnsite
• Build span trees from unordered trace spansMedium

  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.

  DatadogSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute sliding window sums by tagMedium

  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.

  DatadogSoftware EngineerCoding & AlgorithmsOnsite
• Implement Prefix Match FilterHard

  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.

  DatadogSoftware EngineerCoding & AlgorithmsOnsite
• Implement a Snowflake Query ClientMedium

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

  DatadogSoftware EngineerCoding & AlgorithmsOnsite
• Implement buffered file writer with concurrency supportEasy

  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.

  DatadogSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement log storage and queryingMedium

  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.

  DatadogSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement write with internal bufferMedium

  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.

  DatadogSoftware EngineerCoding & AlgorithmsTechnical Screen
• Match logs to prior queriesMedium

  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.

  DatadogSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute exclusive CPU time from nested logsMedium

  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.

  DecagonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Legal Tic-Tac-Toe Games from the Empty BoardHard

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

  DecagonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a Tic-Tac-Toe EngineMedium

  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.

  DecagonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design rolling-window conversation score trackerEasy

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

  DecagonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Enumerate 4x4 Tic-Tac-Toe GamesMedium

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

  DecagonSoftware EngineerCoding & AlgorithmsOnsite
• Implement CSAT tracking and call timingMedium

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

  DecagonSoftware EngineerCoding & AlgorithmsOnsite
• Implement a CSAT Sliding Window TrackerEasy

  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.

  DecagonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement sqrt and parity-based array rearrangementMedium

  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.

  DeshawMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Maximum L1 Distance Between Equal-Length SubarraysMedium

  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.

  DeshawSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve tree equality and valid parenthesesHard

  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.

  Deutsche BankSoftware EngineerCoding & AlgorithmsOnsite
• Count a Character in a StringMedium

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

  DiscordData ScientistCoding & AlgorithmsTechnical Screen
• Implement User Sessionization From Event StreamHard

  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.

  DiscordSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement an asyncio-based chat serverMedium

  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.

  DiscordSoftware EngineerCoding & AlgorithmsOnsite
• Return Words Present in Exactly One MessageMedium

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

  DiscordData ScientistCoding & AlgorithmsTechnical Screen
• Generate All Valid Combinations of Balanced ParenthesesMedium

  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.

  DisneyData EngineerCoding & AlgorithmsOnline Assessment
• Generate All Well-Formed Parenthesis StringsMedium

  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.

  DisneyData EngineerCoding & AlgorithmsOnline Assessment
• Implement an LRU cacheMedium

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

  DisneySoftware EngineerCoding & AlgorithmsOnsite
• Solve grid shortest path with BFSMedium

  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.

  DisneySoftware EngineerCoding & AlgorithmsOnsite