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 901–930 of 3276 results
- 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 - DatabricksHardSoftware EngineerEvaluate ACL rules for IP and CIDR
This problem tests your ability to manipulate binary representations of IP addresses and perform efficient prefix matching using CIDR notation, requiring careful bitwise arithmetic and efficient lookup structures.
Coding & AlgorithmsTechnical ScreenBit ManipulationTrieNetworking - 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 - DatabricksMediumBackend EngineerFind First Anagram Occurrence
This question evaluates proficiency in string processing, character-frequency analysis, and efficient substring search techniques, measuring competency in algorithmic reasoning and implementation for pattern matching.
Coding & AlgorithmsTechnical Screen - DatabricksHardSoftware EngineerFind Path Between Fibonacci Tree Nodes
This problem tests your ability to map nodes in a recursively defined tree structure without materializing the tree, requiring an understanding of Fibonacci sequences and path-finding algorithms in binary trees.
Coding & AlgorithmsTechnical ScreenTreesRecursionMath - 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 EngineerFind first CIDR block covering IP
This question evaluates a candidate's understanding of IPv4 and CIDR notation, ability to perform prefix-based address containment checks using bitwise reasoning, and competence in parsing and efficient lookup across many ranges.
Coding & AlgorithmsTechnical Screen - DatabricksMediumSoftware EngineerFind k customers with least revenue
This question evaluates a candidate's ability to aggregate per-customer revenue from event streams and perform selection on aggregated totals, testing knowledge of data aggregation, selection algorithms, and efficient use of data structures.
Coding & AlgorithmsTechnical Screen - DatabricksHardSoftware EngineerFind path between nodes in Fibonacci tree
This problem tests your ability to navigate implicit tree structures defined by recurrence relations and your proficiency in pathfinding within large graphs without materializing them.
Coding & AlgorithmsTechnical ScreenTreesRecursionFibonacci - DatabricksHardSoftware EngineerFind shortest path in a Fibonacci-ordered tree
This question evaluates understanding of recursive binary tree structures, preorder indexing, Fibonacci-like size relations, and arithmetic-based navigation for computing paths in an implicitly defined tree.
Coding & AlgorithmsTechnical Screen - 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 - DatabricksMediumSoftware EngineerImplement CIDR firewall matcher
This interview question evaluates requirements, scale assumptions, API/data design, architecture, trade-offs, failure modes, and rollout in a realistic interview setting. A strong answer for Implement CIDR firewall matcher states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - 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 - DatabricksMediumSoftware EngineerImplement Snapshot Iterator Without Order Guarantees
This question evaluates data-structure design and iterator semantics—specifically snapshot iteration over a mutable, set-like collection without order guarantees—and tests skills in implementing mutation-isolated iteration and analyzing time and space complexity; it belongs to the Coding & Algorithms domain and emphasizes practical implementation.
Coding & AlgorithmsTechnical Screen - DatabricksHardSoftware EngineerImplement a Snapshot Set Iterator
This question evaluates understanding of set data structures, iterator and snapshot semantics, and the ability to reason about time and space complexity when providing stable views over mutable collections.
Coding & AlgorithmsTechnical Screen - 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 sliding-window hit counter
This question evaluates understanding of time-based data structures and algorithms for sliding-window counters, including fixed-size array bucketing, handling timestamp collisions within buckets, refactoring for reuse, and time/space complexity analysis.
Coding & AlgorithmsTechnical Screen - 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 - DatabricksHardSoftware EngineerImplement an Alternating Tic-Tac-Toe Game
This problem tests your ability to design a robust state machine for a board game, focusing on efficient win-condition checking and clean API design.
Coding & AlgorithmsTechnical ScreenState ManagementArraysGame Theory - 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 EngineerOptimal Commute: Nearest Transit Distance in a City Grid
Tests the ability to solve multi-source shortest path problems on a grid using multi-source Breadth-First Search (BFS). Evaluates graph traversal efficiency, boundary checking, and handling of impassable terrain.
Coding & AlgorithmsTechnical ScreenBreadth-First SearchMatrixGraph - DatabricksHardSoftware EngineerOptimize a SQL query plan tree
This problem tests your ability to manipulate an Abstract Syntax Tree (AST) representing a relational query plan to reduce data processing costs through predicate pushdown and projection pruning.
Coding & AlgorithmsTechnical ScreenTreesRecursionDatabase Internals - 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
Databricks