practice a little every day, paws crossed ♡
Software Engineer 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 721–750 of 2629 results
- DatabricksMediumSoftware EngineerChoose fastest transportation mode on city grid
This problem tests your ability to model a grid-based transportation network as a graph and apply Dijkstra's algorithm to find the optimal path under multiple constraints.
Coding & AlgorithmsTechnical ScreenGraphsDijkstraShortest Path - DatabricksMediumSoftware EngineerCompute 5-minute rolling average load
This problem tests your ability to maintain a rolling window average over a high-throughput stream of events using an efficient data structure that balances memory usage and query time complexity.
Coding & AlgorithmsTechnical ScreenSliding WindowData StructuresTime Series - DatabricksMediumSoftware EngineerCompute last-5-minute QPS in memory
This question evaluates design of in-memory data structures and sliding-window time-series aggregation for real-time metrics, testing understanding of space/time trade-offs, streaming algorithms, and handling monotonic timestamps.
Coding & AlgorithmsTechnical Screen - 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 - DatabricksMediumSoftware EngineerDesign BFS to detect forced win in Tic-Tac-Toe
This question evaluates algorithm design and search-space reasoning, focusing on BFS-based game-tree exploration, state representation, symmetry reduction and hashing, win/draw detection, pruning and move-ordering heuristics, and time/space complexity analysis in terms of n, k, t, and the branching factor within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - DatabricksMediumSoftware EngineerDesign IP/CIDR rule matcher
This question evaluates understanding of IPv4 addressing, CIDR and numeric range representations, plus competency in designing efficient data structures and algorithms for low-latency rule matching with dynamic updates.
Coding & AlgorithmsTechnical Screen - 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 a rolling event tracker with ranges
This question evaluates understanding of time-series data structures and streaming counters, testing algorithm design, space/time complexity analysis, correctness across edge cases, and handling of large-scale event tracking.
Coding & AlgorithmsTechnical Screen - DatabricksMediumSoftware EngineerDesign an IP filter using CIDR rules
This question evaluates understanding of IP addressing and CIDR notation, bit-level conversion between prefixes and integer ranges, and the design of scalable data structures and algorithms for prefix/range queries, rule priority handling, and rule-set operations (allow/deny semantics).
Coding & AlgorithmsTechnical Screen - 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 - DatabricksHardSoftware EngineerDetermine allow/deny for an IP via CIDR rules
This problem tests your ability to efficiently manage and query hierarchical IP address ranges, requiring knowledge of bitwise operations and data structures for range matching.
Coding & AlgorithmsTechnical ScreenBit ManipulationTrieNetworking - 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 - 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
Databricks