practice a little every day, paws crossed ♡
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 2851–2880 of 4616 results
- 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 - NuroHardMachine Learning EngineerDesign an Inference Pipeline
This question evaluates competency in designing production machine-learning inference pipelines, covering model routing, artifact versioning and deployment, feature retrieval at inference time, low-latency/high-availability architectures, monitoring for model quality and data drift, and safe rollout strategies.
ML 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 - NuroHardMachine Learning EngineerFind Maximum Path Sum in N-ary Tree
This question evaluates understanding of tree traversal and aggregation techniques, including handling of variable-arity nodes, negative values, and path-based dynamic programming on N-ary trees.
Coding & AlgorithmsTechnical Screen - 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 - OPPOMediumData Engineer — Data Platform Team (8 engineers)Walk through resume and project highlights
This question evaluates technical communication, leadership, system ownership, impact measurement, stakeholder management, and trade-off reasoning competencies for a Data Engineer.
Behavioral & LeadershipTechnical Screen - 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 - OktaMediumFrontend EngineerDeduplicate an Array in Linear Time
This question tests the ability to implement a deduplication algorithm that preserves the original relative order of elements while maintaining O(n) time and space complexity.
Coding & AlgorithmsTechnical ScreenArraysHash TableTime Complexity - OktaMediumFrontend EngineerDesign High-Throughput Messaging Infrastructure
This problem tests your ability to design a scalable, reliable messaging system by balancing throughput, latency, and data persistence in a high-concurrency environment.
System DesignTechnical ScreenScalabilityMessagingConcurrency - 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 - OktaMediumFrontend EngineerReview Code for Memory Risks
This question tests your ability to identify memory-intensive patterns and performance bottlenecks in JavaScript array manipulation, specifically regarding garbage collection and object reference stability.
Software Engineering FundamentalsTechnical ScreenJavaScriptComplexity AnalysisMemory Management - 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 - OneMain FinancialMediumData ScientistCalculate Break-Even Point and Profit Impact Analysis
This interview question evaluates metric design, causal reasoning, experiment setup, diagnostics, SQL/statistical checks, and recommendations in a realistic interview setting. A strong answer for Calculate Break-Even Point and Profit Impact Analysis states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Analytics & ExperimentationTechnical Screen - OneMain FinancialEasyData ScientistCalculate Break-even for New Credit Card Product Launch
This interview question evaluates metric design, causal reasoning, experiment setup, diagnostics, SQL/statistical checks, and recommendations in a realistic interview setting. A strong answer for Calculate Break-even for New Credit Card Product Launch states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Analytics & ExperimentationTechnical Screen - OneMain FinancialMediumData ScientistDetermine Channel Performance with Additional Metrics Needed
This interview question evaluates metric design, causal reasoning, experiment setup, diagnostics, SQL/statistical checks, and recommendations in a realistic interview setting. A strong answer for Determine Channel Performance with Additional Metrics Needed states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Analytics & ExperimentationTechnical Screen - OneMain FinancialMediumData ScientistDifferentiate and control Type I/II errors
This question evaluates understanding of hypothesis testing fundamentals such as Type I/Type II errors, statistical power and sample size calculation for two-proportion tests, family-wise error rate control (e.g., Bonferroni), and sequential analysis/alpha-spending schemes.
Statistics & MathTechnical Screen - OneMain FinancialEasyData ScientistEvaluate shift from branch to digital channel
This question evaluates a data scientist's ability to analyze channel unit economics, design growth experiments and metrics, and assess operational, fraud, and credit risk implications for shifting acquisition from branch to digital in a credit-card business.
Analytics & ExperimentationTechnical Screen
Nuro
Okta
OneMain Financial