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 1681–1710 of 5874 results
- CursorMediumSoftware EngineerDesign Versioned IDE Settings for Users and Teams
Design a distributed, hierarchical configuration management service for an IDE that synchronizes versioned settings across individual users, multiple teams, and workspaces while supporting offline modifications and deterministic conflict resolution.
System DesignTechnical ScreenDistributed SystemsOffline SyncData Modeling - CursorMediumSoftware EngineerDesign a Durable Cron Job Scheduler
Design a cron scheduler with durable occurrences, timezone rules, missed-run policies, worker leases, idempotent dispatch, and failure recovery.
System DesignTechnical Screen - CursorMediumSoftware EngineerHash a Repository with a Merkle Tree and Find Changed Files
Hash a repository with canonical Merkle nodes, compare changed subtrees, report file changes, and account for symlinks, cached hashes, and snapshot limits.
Software Engineering FundamentalsTechnical Screen - CursorMediumSoftware EngineerImplement Deterministic Merkle Hashing for a Repository
Implement an incremental, deterministic Merkle tree for a virtual repository file system with stable serialization, child ordering, and ancestor cache invalidation.
Software Engineering FundamentalsTechnical ScreenMerkle TreeData StructuresFile Systems - CursorMediumSoftware EngineerImplement a Merkle Tree for Repository Contents
Implement a Merkle tree to model repository file systems and efficiently compute differences between two repository states using subtree hashes.
Software Engineering FundamentalsTechnical ScreenMerkle TreeTreesHashing - CursorHardSoftware EngineerImplement a Merkle-tree repo diff
This question evaluates a candidate's understanding of Merkle trees, filesystem-aware hashing, directory traversal, and diff algorithms for detecting file-level changes.
Coding & AlgorithmsTechnical Screen - CursorMediumSoftware EngineerImplement and Explain a Merkle Tree
Tests understanding of cryptographic hash trees (Merkle trees), including tree construction, odd-node handling, proof generation, and verification.
Software Engineering FundamentalsTechnical Screencryptographydata-structurestrees - DRWEasySoftware EngineerFewest Expenses to Defer to Year End So the Running Balance Never Goes Negative
Given a year's transactions in order, with income as positive values, expenses as negative values and a non-negative total, find the fewest expenses to move to the end of the year so the running balance never drops below zero. It tests reasoning over prefix sums for inputs of up to 100,000 transactions.
Coding & AlgorithmsTechnical Screen - DRWMediumSoftware EngineerLargest Number From a 1-and-2 Digit String With Even Counts of Each Digit
Given a string of 1s and 2s that represents a positive integer, delete characters so the remaining counts of both digits are even, keeping the original order, and return the largest number that can remain. The problem tests careful case analysis of which digit occurrences to remove and efficient string handling for inputs up to 200,000 characters.
Coding & AlgorithmsHR Screen - DRWEasySoftware EngineerLongest Substring in Which Every Present Letter Occurs Equally Often
Given a string of lowercase letters, find the length of the longest substring in which every letter that appears occurs the same number of times. It tests substring enumeration with incremental frequency tracking and a precise definition of what counts as balanced.
Coding & AlgorithmsTechnical Screen - DRWHardSoftware EngineerMaximize a Digit Subsequence with Even Counts of Ones and Twos
Find the lexicographically/numerically largest subsequence of a string of '1's and '2's containing an even number of both digits in linear time.
Coding & AlgorithmsHR Screengreedystringssubsequences - DRWEasySoftware EngineerMinimize the Max-Min Gap of an Array After Changing Up to Three Elements
Given an integer array, you may change up to three elements to any values; return the smallest possible difference between the largest and smallest values afterward. It tests reasoning about which extreme values are worth changing and careful handling of short arrays.
Coding & AlgorithmsTechnical Screen - DRWMediumSoftware EngineerSolve odd-string, digit swap, patient slot assignment
This multi-part problem evaluates string manipulation and parity/combinatorics for constructing odd-occurrence strings, greedy optimization and minimal-change reasoning for digit-swap distance minimization, and bipartite matching/assignment skills for patient slot allocation.
Coding & AlgorithmsOnline Assessment - DRWMediumSoftware EngineerSolve three algorithmic OA problems
This set evaluates algorithmic problem-solving skills including array manipulation and simulation for knockout tournament dynamics, graph traversal and constructive movement-sequence design on grids, and broader competencies in handling permutations, connectivity, and constraint-driven constructions.
Coding & AlgorithmsOnline Assessment - DRWMediumSoftware EngineerSolve three algorithmic OA tasks
Solve three algorithmic OA tasks evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnline Assessment - Da Vinci TradingHardSoftware EngineerDesign an in-memory order matching engine
Matching engine design guide for an in-memory order book. Covers price-time priority, limit and market orders, matching rules, data-structure choices, edge cases, and how to explain tradeoffs in a system design interview.
System DesignOnline Assessment - Dark Alpha CapitalMediumSoftware EngineerMinimize Total Assignment Distance
This question evaluates competency in combinatorial optimization, assignment/matching problems, and reasoning about Manhattan distance cost metrics. Commonly asked to assess algorithmic reasoning about constrained assignments, search and complexity trade-offs, it belongs to the Coding & Algorithms domain and emphasizes practical application of algorithm design and implementation rather than purely conceptual theory.
Coding & AlgorithmsTechnical Screen - DatabricksMediumSoftware EngineerAdd Sliding-Window Get and Put Activity Metrics to a Key-Value Store
Design and implement an in-memory key-value store that tracks read and write throughput (operations per second) over configurable sliding windows.
Software Engineering FundamentalsOnsitedata-structuressliding-windowsystem-design - DatabricksMediumSoftware EngineerAnswer behavioral screen questions
Answer behavioral screen questions evaluates behavioral evidence, ownership, communication, trade-offs, and measurable outcomes in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Behavioral & LeadershipHR Screen - 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 - DatabricksMediumSoftware EngineerBuild a Durable Key-Value Cache
This question tests the ability to design a crash-recoverable key-value store by implementing a write-ahead log (WAL) to ensure data durability and system integrity after an unexpected failure.
Software Engineering FundamentalsOnsiteSystems DesignDurabilityLogging - DatabricksMediumSoftware EngineerCheck if CIDR is fully canceled by rules
This question evaluates understanding of IPv4 CIDR arithmetic, set operations on IP ranges (overlap detection and subtraction), and ordered rule semantics for allow/deny processing.
Coding & AlgorithmsTechnical Screen - 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 EngineerCurrent Role, Proudest Project, Disputed Feedback and Technical Disagreement
Prepare for a four-question behavioral round: describe your current role and why you want to join the company, the project you are proudest of, feedback you disagreed with and how you reacted, and a technical disagreement with a co-worker and how it was resolved.
Behavioral & LeadershipOnsite - DatabricksMediumSoftware EngineerDescribe project impact and critical feedback
This question evaluates behavioral and leadership competencies such as ownership, collaboration, communication, judgment, problem-solving, and receptiveness to critical feedback through recounting project impact and responses to criticism.
Behavioral & LeadershipOnsite - DatabricksMediumSoftware EngineerDescribe your background and impact
This question evaluates a candidate's ability to concisely communicate a career narrative, quantify technical impact, and articulate systems engineering experience—covering roles, core technologies, system scale, measurable outcomes, and motivations.
Behavioral & LeadershipHR Screen - 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
Cursor
DRW
Databricks