Coding & Algorithms interview questions

Showing 1951–1980 of 3276 results

• Design and explain robust web APIs for ML inferenceHard

  This question evaluates a candidate's proficiency in designing HTTP REST APIs for ML inference, including API endpoints, versioning, idempotency, request/response schemas, authentication/authorization, rate limiting, observability, and backward-compatibility policies, and it falls under the Coding & Algorithms domain for a data scientist role.

  NVIDIAData ScientistCoding & AlgorithmsHR Screen
• Design and implement an LRU cacheMedium

  This problem tests your ability to design a cache that supports O(1) time complexity for both insertions and lookups by combining a hash map with a doubly linked list.

  NVIDIASoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine Whether One Point Can Reach AnotherHard

  Determine whether a starting point (sx, sy) can reach a target (tx, ty) on a 2D integer grid via addition moves, optimized for coordinates up to 10^18.

  NVIDIASoftware EngineerCoding & AlgorithmsTechnical Screen
• Explain a shader compiler pipelineMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Explain a shader compiler pipeline states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  NVIDIASoftware EngineerCoding & AlgorithmsOnline Assessment
• Find Top K Frequent ElementsMedium

  This question evaluates a candidate's proficiency with frequency counting, selection techniques, use of appropriate data structures, and algorithmic time and space complexity analysis.

  NVIDIASoftware EngineerCoding & AlgorithmsTechnical Screen
• Find all unique triplets summing to zeroMedium

  This question evaluates array-based algorithm design, handling of duplicate results, and analysis of time and space complexity when producing unique triplets that sum to zero.

  NVIDIASoftware EngineerCoding & AlgorithmsOnsite
• Find minimum time to cross bridge with flashlightMedium

  This problem tests your ability to model a greedy strategy and handle state transitions under constraints to minimize the total time taken for a group to cross a bridge.

  NVIDIASoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the nth prime numberEasy

  This question assesses algorithmic problem-solving and number-theoretic computation skills, requiring efficient prime generation and complexity analysis in the Coding & Algorithms domain.

  NVIDIASoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement CUDA-tiled matrix multiplication and explain architectureHard

  This question evaluates a candidate's competency in CUDA GPU programming, parallel algorithms, and performance engineering for FP32 matrix multiplication, covering tiling strategies, memory hierarchy (global/shared/register), synchronization, numerical precision, and occupancy/resource analysis.

  NVIDIAData ScientistCoding & AlgorithmsHR Screen
• Implement core graph algorithms for graphicsMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Implement core graph algorithms for graphics states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  NVIDIASoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement short algorithms on logs, grids, and stringsHard

  This problem tests your ability to handle multi-stage data processing, specifically focusing on greedy interval selection in logs, stack-based parsing of nested strings, and constrained combinatorial optimization on a grid.

  NVIDIASoftware EngineerCoding & AlgorithmsOnsite
• Merge Overlapping Time IntervalsMedium

  Practice a NVIDIA coding interview problem focused on merge overlapping time intervals. The prompt emphasizes edge cases, clean implementation, and verifiable test behavior without revealing the solution.

  NVIDIAData EngineerCoding & AlgorithmsTechnical Screen
• Normalize an Absolute Unix-Style File Path to Canonical FormMedium

  Convert an absolute Unix-style file path into canonical form by collapsing repeated slashes, dropping current-directory markers, applying parent-directory moves that stop at the root, and treating other dot-only names as ordinary directories. Tests careful string parsing and edge-case handling of path components.

  NVIDIASoftware EngineerCoding & AlgorithmsOther
• Optimize CUDA GEMM with tiling and coalescingHard

  This question evaluates proficiency in GPU programming and performance optimization, assessing understanding of the CUDA execution model, memory hierarchy and bank conflicts, occupancy limits, and practical kernel design concerns for single-precision GEMM including tiling, coalescing, vectorized memory accesses and benchmarking.

  NVIDIAData ScientistCoding & AlgorithmsHR Screen
• Reconstruct tree from inorder and postorderMedium

  This question evaluates understanding of binary tree traversal relationships, recursive construction techniques, and algorithmic time and space complexity, reflecting core data structures and recursion competencies.

  NVIDIASoftware EngineerCoding & AlgorithmsTechnical Screen
• Return all file paths via DFSEasy

  This question evaluates understanding of tree traversal and depth-first search along with competence in handling hierarchical data structures and constructing full file paths.

  NVIDIASoftware EngineerCoding & AlgorithmsTechnical Screen
• Reverse linked lists, including k-groupHard

  This question evaluates understanding of linked list manipulation including pointer operations, in-place reversal techniques, recursion and stack-depth considerations, cycle detection, and time/space complexity analysis.

  NVIDIAData ScientistCoding & AlgorithmsHR Screen
• Solve anagram grouping and in-place allocatorMedium

  This problem tests string hashing/sorting techniques for grouping anagrams and the ability to manage fixed-size memory blocks in-place without auxiliary data structures.

  NVIDIASoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve small string and API tasksMedium

  This problem tests your ability to handle nested structural validation using stacks and the design of a robust API integration function that aggregates paginated responses.

  NVIDIASoftware EngineerCoding & AlgorithmsOnsite
• Solve unique triplets summing to targetMedium

  Solve unique triplets summing to target 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.

  NVIDIASoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Minesweeper click and printMedium

  Implement Minesweeper click and print 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.

  Nash AISoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Minesweeper click-to-reveal expansionMedium

  This problem tests your ability to implement recursive traversal (flood-fill) on a 2D grid and manage game state transitions based on player input.

  Nash AISoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve four coding problemsMedium

  This set of problems evaluates algorithmic problem-solving skills focused on array and string manipulation, frequency and multiset reasoning, sliding-window and coverage concepts, and combinatorial counting for palindromability.

  NebiusSoftware EngineerCoding & AlgorithmsOnline Assessment
• Identify the Orchestrator in a Server Connection GraphMedium

  This problem tests graph theory fundamentals by identifying a central hub node in a star-topology network using adjacency properties.

  NetappSoftware EngineerCoding & AlgorithmsOnsite
• Merge Two Sorted Singly Linked ListsMedium

  This problem tests the ability to manipulate pointers in a singly linked list to perform an in-place merge of two sorted lists.

  NetappSoftware EngineerCoding & AlgorithmsOnsite
• Rank Teams from Ballot PreferencesMedium

  This problem tests your ability to manage multi-level sorting criteria by implementing custom comparison logic for an array of preference rankings.

  NetappSoftware EngineerCoding & AlgorithmsOnsite
• Analyze Overlap in Closed IntervalsMedium

  Implement an algorithm to determine how many closed intervals contain each point in a given list of query coordinates. The problem evaluates interval sweep-line techniques or binary search decomposition, boundary handling, and time/space complexity.

  NetflixSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Earliest Completion TimesHard

  This question evaluates understanding of directed acyclic graphs, dependency resolution, computation of earliest task completion times, and cycle detection within prerequisite relationships.

  NetflixSoftware EngineerCoding & AlgorithmsOnsite
• Compute Minimum Broadcast Latencies Between CitiesEasy

  Implement Dijkstra's algorithm to compute the minimum broadcast latency from a source city to all other cities in an undirected, weighted network.

  NetflixSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Minimum Task Completion TimeMedium

  This problem tests your ability to model task dependencies as a Directed Acyclic Graph (DAG) and compute the longest path in that graph to determine the earliest completion time.

  NetflixSoftware EngineerCoding & AlgorithmsTechnical Screen