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 1741–1770 of 2810 results
- NuroHardSoftware EngineerCheck Vertical Reflection Symmetry with Duplicate Points
Determine whether a multiset of 2D points is symmetric across a vertical line, preserving duplicate counts and allowing half-integer axes.
Coding & AlgorithmsTechnical Screen - NuroHardSoftware EngineerCoordinate Video Reading and Rendering at 25 Frames per Second
Design a 25fps video player with serialized unsafe APIs, bounded producer-consumer buffering, deadline pacing, and explicit timing feasibility limits.
Software Engineering FundamentalsTechnical Screen - NuroMediumSoftware EngineerDesign a Reliable Job Scheduler
Design a fault-tolerant distributed job scheduler capable of handling delayed execution, job cancellation, timeout detection, and automatic worker retries.
System DesignTechnical ScreenDistributed SystemsJob SchedulerFault Tolerance - NuroMediumSoftware EngineerDesign a Scheduler for Weekly Self-Driving Simulation Jobs with Dependent Phases
A system design question about scheduling a weekly batch of about 10,000 self-driving car simulation cases, where each case runs several phases that depend on one another. It tests dependency tracking, dispatch to GPU and CPU worker pools, retries and leases, prioritization against a deadline, and observability.
System DesignTechnical Screen - NuroMediumSoftware EngineerDesign fast search for AV raw logs
This question tests the ability to architect a distributed storage and retrieval system capable of handling high-velocity, high-volume sensor telemetry data while supporting efficient time-range queries.
System DesignTechnical ScreenDistributed SystemsData EngineeringTime-Series - NuroMediumSoftware EngineerFind Intersections Between Two Interval Lists
This problem tests your ability to efficiently merge and find overlaps between two sorted interval lists using a two-pointer approach.
Coding & AlgorithmsTechnical ScreenTwo PointersIntervalsSorting - NuroMediumSoftware EngineerFind gaps between intervals
This question evaluates interval manipulation and range-coverage reasoning, testing skills in sorting, merging overlapping ranges, and handling boundary conditions within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - NuroMediumSoftware EngineerGenerate Weighted Random Keys With Add And Remove
This problem tests your ability to efficiently manage a collection of weighted items and perform random sampling based on those weights, requiring O(log N) updates and lookups.
Coding & AlgorithmsTechnical ScreenData StructuresPrefix SumBinary Search - NuroMediumSoftware EngineerGroup points by distance threshold
This problem tests your ability to efficiently group spatial points based on proximity using graph traversal or clustering techniques while managing computational complexity.
Coding & AlgorithmsTechnical ScreenGraphsGeometryDSU - NuroMediumSoftware EngineerMap Weighted Random Draws to Indices
This problem tests your ability to efficiently map a series of random draws to specific indices based on provided weights using binary search techniques.
Coding & AlgorithmsTechnical ScreenArraysBinary SearchPrefix Sum - NuroMediumSoftware EngineerMaximize Revenue With Two Contiguous Delivery Routes
This problem tests dynamic programming and prefix-max techniques to find the maximum revenue of two non-overlapping subarrays with given length constraints.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingSliding WindowPrefix Sums - NuroMediumSoftware EngineerPick Two Trees for a Zipline That Maximizes Height Times Span
A coding question that recasts the classic two-line container problem as choosing two trees in a row to string a zipline between. It asks for the largest value of the shorter tree's height times the distance between the two trees, over arrays of up to 100,000 heights, and tests efficient pair selection.
Coding & AlgorithmsTechnical Screen - NuroMediumSoftware EngineerReveal a Minesweeper Board
This problem tests recursive graph traversal (DFS/BFS) and grid manipulation logic to implement the recursive uncovering mechanism found in Minesweeper.
Coding & AlgorithmsTechnical ScreenDFSRecursion2D-Grid - NuroHardSoftware EngineerReveal a Minesweeper Region with Adjacent-Mine Counts
Implement a Minesweeper cell-reveal algorithm that dynamically calculates 8-directional mine adjacencies and expands blank regions while safely avoiding recursion depth pitfalls on large boards.
Coding & AlgorithmsTechnical Screenbfsdfsmatrix - NutanixHardSoftware EngineerFind Peak Memory Usage Across Process Intervals
Calculate the peak simultaneous memory usage from a set of half-open intervals and identify the earliest continuous time window sustaining that peak.
Coding & AlgorithmsTechnical Screensweep-lineintervalsprefix-sum - NutanixHardSoftware EngineerFind the Most Reliable Path Through a Network
Implement an algorithm to find the maximum end-to-end success probability between two nodes in an undirected network with multiplicative edge probabilities. Tests graph traversal, Dijkstra's algorithm variant with max-heaps, and edge-case handling.
Coding & AlgorithmsTechnical ScreenGraphDijkstraHeap - OdeEasySoftware EngineerLive TDD Pairing: Grow a Multiset Class One Test at a Time
A live test-driven pairing exercise where you narrate test cases for a multiset (bag) class one behavior at a time while the interviewer writes the code, judged on test design, incremental thinking, and how you talk through implementation choices.
Software Engineering FundamentalsTechnical Screentddpair-programmingtesting - OdeEasySoftware EngineerTest-Driven Pair Programming: Grow a Java Set Class from Unit Tests
A test-driven pair-programming exercise in which you describe unit tests while the interviewer types, growing a Java set class one operation at a time with the simplest code that makes each test pass. It tests test-case design, incremental refactoring, clear verbal communication and how you would later expand the set.
Software Engineering FundamentalsTechnical Screen - OktaMediumSoftware EngineerBehavioral: How You Use AI, Lead Engineers, and Work with Another Team or PM
A three-part behavioral screen for a software engineer: how you use AI tools in your engineering work, a time you led other engineers on a project, and a project you delivered with another team or a product manager. Tests judgment about AI output, technical leadership, and cross-functional collaboration.
Behavioral & LeadershipTechnical Screen - OktaMediumSoftware EngineerDesign a Metrics Storage Platform
This question assesses the ability to architect a scalable time-series database capable of handling high-velocity metric ingestion, efficient long-term storage, and sub-second query performance.
System DesignTechnical ScreenTime SeriesScalabilityData Modeling - OktaMediumSoftware EngineerValidate IPv4 Address List
This problem tests your ability to parse strings and apply conditional logic to validate technical data against specific constraints.
Coding & AlgorithmsTechnical ScreenStringsParsingValidation - OkxMediumSoftware EngineerGroup Strings By Anagram Signature
This problem tests your ability to normalize strings into canonical forms using hashing or frequency counting to identify anagrams efficiently.
Coding & AlgorithmsTechnical ScreenHash MapStringsAnagrams - OnepayEasySoftware EngineerCount Complete Highway Journeys from Toll Logs
This problem tests string manipulation, hash map usage, and state tracking to identify valid entry-to-exit sequences from an unordered stream of toll logs.
Coding & AlgorithmsTechnical ScreenHash MapsSortingData Streams - OnepayMediumSoftware EngineerDebug and Extend a Device Registry: Status Validation, Active Counts, Bulk Updates
A progressive coding exercise on a device registry: find the bug behind a failing test where a device's status must be allowed for its type, then add validated registration, per-type counts of active devices that omit zeros, and a bulk status update based on maintenance time and failure count. It tests code reading and business logic.
Software Engineering FundamentalsTechnical Screen - OnepayEasySoftware EngineerDesign a Discord-Style Communication Platform
This problem tests your ability to design a scalable real-time messaging architecture, focusing on handling message persistence, state synchronization for offline clients, and channel-based message distribution.
System DesignTechnical ScreenReal-timeScalabilityMessaging - OpenAIMediumSoftware EngineerAt-Least-Once Job Queue with Timeouts, Retries, a Dead-Letter Queue and Dependencies
Implement an in-memory job queue with enqueue, reserve, pass, fail and a dead-letter queue, where reservations that outlive their timeout are redelivered for at-least-once delivery, then extend enqueue with job dependencies. It tests state-machine design, timeout tracking, retry accounting and dependency handling.
Software Engineering FundamentalsTechnical Screen - OpenAIHardSoftware EngineerCheapest Daily Shirt Colors With No Color Repeated on Consecutive Days
Pick a blue, green or red shirt for each of n days so that the total price is as low as possible while never buying the same color on two consecutive days, and return the chosen color sequence. It tests dynamic programming over a small state space and reconstruction of the optimal choices.
Coding & AlgorithmsTechnical Screen - OpenAIHardSoftware EngineerCheapest Paint-Booth Color Schedule With No Repeat on Consecutive Cars
Choose one of three paint colors for each car on an assembly line to minimize total cost, never repeating a color on consecutive cars, and return the exact color chosen for each car.
Coding & AlgorithmsTechnical Screendynamic-programmingreconstructiongreedy-vs-dp - OpenAIMediumSoftware EngineerClarify a Machine Topology Coding Task
Implement and formalize an API to analyze distributed accelerator interconnect topologies, separating summary metrics from component-level graph structures and validating topologies like rings, cliques, and lines.
Software Engineering FundamentalsTechnical Screengraph-algorithmsbfsapi-design - OpenAIHardSoftware EngineerCompute Infection Time in a Grid
This problem tests your ability to model state propagation in a 2D grid using Breadth-First Search (BFS) to determine the time required for a dynamic condition to cover all reachable nodes.
Coding & AlgorithmsTechnical ScreenBFSGraphSimulation
Nuro
Okta
OpenAI