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 271–300 of 1080 results
- CrowdstrikeMediumSoftware EngineerMaximize the minimum value along a grid path
This problem tests your ability to combine binary search on the answer with graph traversal techniques (BFS/DFS/Union-Find) to solve optimization problems on a 2D grid.
Coding & AlgorithmsOnsiteBinary SearchBFSDFS - CrusoeEasySoftware EngineerImplement Interval Overrides and Top-K Strings
Implement interval override logic for half-open ranges and calculate the top-k labels based on total active duration with lexicographical tie-breaking.
Coding & AlgorithmsOnsiteintervalssortinghash-table - DRWMediumData ScientistSolve movie ratings, array, release scheduler
This question tests algorithmic problem-solving across three domains: greedy array optimization, tree-based data structure design, and efficient sequence merging. It evaluates practical coding ability and complexity analysis, commonly used in quantitative and data science interviews to assess how candidates identify inefficiencies and select the right data structure to improve performance.
Coding & AlgorithmsOnsite - DRWMediumData ScientistSolve three algorithmic tasks in Python
This question evaluates proficiency in dynamic programming, range-query data structures (Fenwick/segment tree), sorting and two-pointer techniques, and algorithmic complexity analysis within the Coding & Algorithms domain for Python-based implementation.
Coding & AlgorithmsOnsite - DatabricksHardSoftware EngineerBuild a Constant-Time Snapshot Set Iterator
Design a mutable ordered integer set that supports constant-time snapshot iterator creation without copying the live dataset, preserving insertion order and handling elements that are removed and re-added.
Coding & AlgorithmsOnsiteData StructuresDesignLinked List - DatabricksHardSoftware EngineerConvert an IP range to minimal CIDRs
This problem tests your ability to manipulate IP address representations and implement a greedy strategy to decompose an arbitrary range of IPv4 addresses into the minimum number of CIDR blocks.
Coding & AlgorithmsOnsiteBit ManipulationGreedyNetworking - DatabricksMediumMachine Learning EngineerDelete a Character From Cover
This problem tests your ability to manage dynamic string indices by maintaining a set of active intervals and adjusting them efficiently after a character deletion.
Coding & AlgorithmsOnsiteStringsIntervalsArrays - DatabricksMediumSoftware EngineerDesign Tic-Tac-Toe and QPS data structures
This question evaluates data-structure and API design skills, covering state management and efficient update/query algorithms for a generalized Tic-Tac-Toe with uniform-random move selection, as well as time-series aggregation and streaming-log techniques for computing QPS from non-decreasing timestamps.
Coding & AlgorithmsOnsite - DatabricksMediumSoftware EngineerDesign an efficient Tic-Tac-Toe engine
This question evaluates a candidate's understanding of efficient algorithm design and minimal state management for a Tic-Tac-Toe engine on an n x n board, including constraints such as O(1) time per move and O(n) space.
Coding & AlgorithmsOnsite - DatabricksMediumSoftware EngineerDesign an n x n Tic-Tac-Toe Game
This problem tests your ability to design an efficient class to manage game state, focusing on constant-time win condition checking using auxiliary data structures.
Coding & AlgorithmsOnsiteObject-Oriented DesignData StructuresOptimization - DatabricksMediumSoftware EngineerDetect a K-in-a-Row Win on a Rectangular Board
Implement an efficient win-detection function that checks whether a newly placed token forms at least k consecutive matching tokens along any linear axis on a rectangular grid.
Coding & AlgorithmsOnsiteArraysMatrixGame Theory - DatabricksMediumSoftware EngineerEarliest Substring That Is a Rearrangement of a Pattern
Find the starting index of the first substring of a text that is a rearrangement of a given pattern, or report that none exists. Tests fixed-length sliding windows, character-frequency bookkeeping and linear-time scanning of long strings with an early exit.
Coding & AlgorithmsOnsite - DatabricksMediumSoftware EngineerFastest Single-Mode Commute on a Grid with Per-Step Time and Cost
Given a city grid with a start, a destination and cells usable by only one of four commute modes, choose the mode whose trip takes the least total time, breaking ties by lower total cost. Tests shortest-path search on grids, per-mode reachability and precise tie-breaking.
Coding & AlgorithmsOnsite - DatabricksHardSoftware EngineerFind all anagram start indices
This problem tests your ability to efficiently detect pattern matches within a stream or string using a sliding window technique and frequency mapping.
Coding & AlgorithmsOnsiteStringsSliding WindowHash Map - DatabricksMediumSoftware EngineerFirst-Match CIDR Firewall: Status of an IP Address or a Whole CIDR Block
Implement an ordered first-match IPv4 firewall that returns ALLOW or DENY for an address, then extend it so the target can be a whole CIDR block that is allowed only if every address inside it is. Tests bit-level prefix matching and reasoning about address ranges at scale.
Coding & AlgorithmsOnsite - DatabricksMediumSoftware EngineerGeneralized m x n Tic-Tac-Toe with a k-in-a-Row Win Check
Implement tic-tac-toe on an m by n board where a player wins with k consecutive marks in a row, column or either diagonal, returning the winner after each move. Tests incremental win detection that avoids rescanning the board, plus careful handling of edges and both diagonal directions.
Coding & AlgorithmsOnsite - DatabricksHardSoftware EngineerImplement Generalized Tic-Tac-Toe
Design and implement a generalized m x n Tic-Tac-Toe game supporting an arbitrary winning streak length k. Tests grid simulation, efficient line checking around the latest move, and handling boundary conditions.
Coding & AlgorithmsOnsiteDesignArrayMatrix - DatabricksHardSoftware EngineerImplement a Tic-Tac-Toe game API
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 & AlgorithmsOnsiteAlgorithmsData StructuresOptimization - DatabricksMediumSoftware EngineerImplement a rate-limited hit counter
This question evaluates a candidate's understanding of designing efficient time-windowed data structures and algorithmic analysis, including space-time trade-offs and amortized complexity.
Coding & AlgorithmsOnsite - DatabricksMediumSoftware EngineerImplement a snapshotable set with iterators
This question evaluates understanding of persistent/versioned data structures, iterator semantics, concurrency control, and complexity-aware design for mutable sets, and is categorized under Coding & Algorithms.
Coding & AlgorithmsOnsite - DatabricksMediumSoftware EngineerImplement lazy array and KV store
This problem tests your ability to implement lazy computation using function composition and design a stateful data structure with metadata tracking.
Coding & AlgorithmsOnsiteFunctional ProgrammingData StructuresAPI Design - DatabricksMediumSoftware EngineerImplement run-length encoding and decoding
This question evaluates proficiency in string manipulation and encoding algorithms, specifically run-length encoding and decoding, along with attention to edge cases such as empty inputs and single-character runs and correct handling of repetition counts.
Coding & AlgorithmsOnsite - DatabricksHardSoftware EngineerImplement streaming RLE and bit-packed codec
This question evaluates understanding of data compression algorithms, bit-level manipulation, two's‑complement integer representation, streaming algorithm design, and encoder/decoder state management for 32-bit signed integers.
Coding & AlgorithmsOnsite - DatabricksMediumSoftware EngineerPartition a Target String by Source Substrings
Determine the minimum number of contiguous substrings from a source string required to reconstruct a target string.
Coding & AlgorithmsOnsitestringsgreedysuffix-automaton - DatabricksMediumSoftware EngineerPath Between Two Preorder-Numbered Nodes of an Implicit Fibonacci Tree
Given the order of a recursively defined Fibonacci tree and two nodes labeled by preorder number, return the path between them without building a tree that can hold trillions of nodes. Tests recursive subtree-size reasoning, implicit tree navigation and 64-bit index arithmetic.
Coding & AlgorithmsOnsite - DatabricksMediumSoftware EngineerReferral Credit Tracker with Indirect Referrals
Build a referral credit tracker with account creation, threshold queries, deterministic ordering, and correct credit propagation through indirect referrals.
Coding & AlgorithmsOnsite - DatabricksMediumSoftware EngineerReport the Winner After Every Move on an n x n Tic-Tac-Toe Board
Process a sequence of alternating tic-tac-toe moves on an n x n board and report, after every move, whether player 1 or player 2 has just completed a full row, column, main diagonal or anti-diagonal. Tests efficient incremental win detection, diagonal indexing and correct handling of draws.
Coding & AlgorithmsOnsite - DatabricksMediumSoftware EngineerTic-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 EngineerTic-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 EngineerCompute 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