Nuro interview questions

Showing 1–29 of 29 results

• Assign Robots to Nearest Pickup Items on a Grid with ObstaclesMedium

  Given a grid with blocked cells, k delivery robots and k pickup items, assign every robot exactly one item by repeatedly matching the closest remaining robot-item pair under fixed tie-breaking rules. It tests shortest-path distances on grids with obstacles and careful, deterministic greedy assignment.

  NuroSoftware EngineerCoding & AlgorithmsTechnical Screen
• Build a Concurrent Recurring Job SchedulerMedium

  This problem tests your ability to design a thread-safe, concurrent task scheduling system that manages recurring executions while handling lifecycle events like cancellation and graceful shutdown.

  NuroSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Build a Thread-Safe Video Playback Loop at 25 FPSHard

  Design and implement a thread-safe video playback engine that decodes and renders frames at a steady 25 frames per second using bounded buffering and precise monotonic scheduling.

  NuroSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• C++ K-Way Merge of Timestamped Records with Clean Class Design and Hand-Written TestsHard

  Merge k input sequences of timestamped records, each already sorted by timestamp, into one ordered sequence in C++. The exercise stresses defining the record type, the merging class's state and interface, deterministic handling of equal timestamps, and writing your own C++ test cases without a judge harness.

  NuroSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Check Vertical Reflection Symmetry with Duplicate PointsHard

  Determine whether a multiset of 2D points is symmetric across a vertical line, preserving duplicate counts and allowing half-integer axes.

  NuroSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compare Locks and MVCC in a Versioned StoreHard

  Tests deep understanding of concurrency control paradigms by comparing pessimistic locking against Multi-Version Concurrency Control (MVCC) in a versioned key–value storage engine, focusing on version lifecycle, garbage collection, and read/write trade-offs.

  NuroSoftware EngineerSoftware Engineering FundamentalsOnsite
• Compute unique duration by merging intervalsEasy

  This question evaluates a data engineer's proficiency in temporal data manipulation and interval-set reasoning using SQL and Python, specifically skills in merging overlapping intervals and computing deduplicated cumulative durations.

  NuroData EngineerData Manipulation (SQL/Python)Technical Screen
• Coordinate Video Reading and Rendering at 25 Frames per SecondHard

  Design a 25fps video player with serialized unsafe APIs, bounded producer-consumer buffering, deadline pacing, and explicit timing feasibility limits.

  NuroSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Design Webhooks and Metric AggregationHard

  Design a webhook delivery platform and vehicle telemetry aggregation system. The solution covers multi-tenant subscriptions, at-least-once delivery, retries, signing, DLQs, endpoint isolation, high-volume ingestion, stream processing, raw storage, rollups, alerting, late events, and downsampling.

  NuroBackend EngineerSystem DesignOnsite
• Design a Reliable Job SchedulerMedium

  Design a fault-tolerant distributed job scheduler capable of handling delayed execution, job cancellation, timeout detection, and automatic worker retries.

  NuroSoftware EngineerSystem DesignTechnical Screen
• Design a Scheduler for Weekly Self-Driving Simulation Jobs with Dependent PhasesMedium

  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.

  NuroSoftware EngineerSystem DesignTechnical Screen
• Design a Shared Distributed ML Training PlatformHard

  Design a multi-tenant distributed machine learning training platform that orchestrates GPU clusters, enforces team quotas, guarantees gang scheduling, and handles node-level checkpointing and recovery.

  NuroSoftware EngineerML System DesignOnsite
• Design an Inference PipelineHard

  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.

  NuroMachine Learning EngineerML System DesignTechnical Screen
• Design fast search for AV raw logsMedium

  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.

  NuroSoftware EngineerSystem DesignTechnical Screen
• Explain Project Scope, Ownership, and Technical ChallengesHard

  Assess a candidate's ability to articulate end-to-end technical leadership, architectural decision-making, and deep problem-solving on a complex engineering project. Evaluates clear communication of personal ownership, rigorous validation methods, and retrospective insights.

  NuroSoftware EngineerBehavioral & LeadershipOnsite
• Find Intersections Between Two Interval ListsMedium

  This problem tests your ability to efficiently merge and find overlaps between two sorted interval lists using a two-pointer approach.

  NuroSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Maximum Path Sum in N-ary TreeHard

  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.

  NuroMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Find gaps between intervalsMedium

  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.

  NuroSoftware EngineerCoding & AlgorithmsTechnical Screen
• Generate Weighted Random Keys With Add And RemoveMedium

  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.

  NuroSoftware EngineerCoding & AlgorithmsTechnical Screen
• Group points by distance thresholdMedium

  This problem tests your ability to efficiently group spatial points based on proximity using graph traversal or clustering techniques while managing computational complexity.

  NuroSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement BFS and a Job SchedulerHard

  Solve grid reveal with BFS and design a thread-safe periodic job scheduler. The solution covers Minesweeper-style expansion, queue processing, priority-queue scheduling, locks, worker pools, cancellation, duplicate prevention, long-running tasks, clock drift, and backpressure.

  NuroBackend EngineerCoding & AlgorithmsOnsite
• Implement a thread-safe periodic job schedulerHard

  Implement a thread-safe periodic job scheduler evaluates engineering fundamentals, trade-offs, examples, pitfalls, and operational implications in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  NuroSoftware EngineerSoftware Engineering FundamentalsOnsite
• Map Weighted Random Draws to IndicesMedium

  This problem tests your ability to efficiently map a series of random draws to specific indices based on provided weights using binary search techniques.

  NuroSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize Revenue With Two Contiguous Delivery RoutesMedium

  This problem tests dynamic programming and prefix-max techniques to find the maximum revenue of two non-overlapping subarrays with given length constraints.

  NuroSoftware EngineerCoding & AlgorithmsTechnical Screen
• Pick Two Trees for a Zipline That Maximizes Height Times SpanMedium

  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.

  NuroSoftware EngineerCoding & AlgorithmsTechnical Screen
• Reveal a Minesweeper BoardMedium

  This problem tests recursive graph traversal (DFS/BFS) and grid manipulation logic to implement the recursive uncovering mechanism found in Minesweeper.

  NuroSoftware EngineerCoding & AlgorithmsTechnical Screen
• Reveal a Minesweeper Region with Adjacent-Mine CountsHard

  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.

  NuroSoftware EngineerCoding & AlgorithmsTechnical Screen
• Schedule CPU and GPU Video ProcessingHard

  Design a distributed heterogeneous batch-processing system to schedule and execute multi-stage video pipelines across CPU and GPU worker clusters with fault tolerance, backpressure, and cost-efficient resource management.

  NuroSoftware EngineerSystem DesignOnsite
• Search Large Vehicle Records with Bounded MemoryHard

  Design a petabyte-scale search engine for autonomous vehicle records supporting multidimensional range queries, bounded-memory query execution, and stable streaming pagination.

  NuroSoftware EngineerSystem DesignOnsite