practice a little every day, paws crossed ♡
Coding & Algorithms 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 1951–1980 of 3276 results
- NVIDIAHardData ScientistDesign and explain robust web APIs for ML inference
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.
Coding & AlgorithmsHR Screen - NVIDIAMediumSoftware EngineerDesign and implement an LRU cache
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.
Coding & AlgorithmsTechnical ScreenHash MapLinked ListCaching - NVIDIAHardSoftware EngineerDetermine Whether One Point Can Reach Another
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.
Coding & AlgorithmsTechnical ScreenMathNumber TheoryGreedy - NVIDIAMediumSoftware EngineerExplain a shader compiler pipeline
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.
Coding & AlgorithmsOnline Assessment - NVIDIAMediumSoftware EngineerFind Top K Frequent Elements
This question evaluates a candidate's proficiency with frequency counting, selection techniques, use of appropriate data structures, and algorithmic time and space complexity analysis.
Coding & AlgorithmsTechnical Screen - NVIDIAMediumSoftware EngineerFind all unique triplets summing to zero
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.
Coding & AlgorithmsOnsite - NVIDIAMediumSoftware EngineerFind minimum time to cross bridge with flashlight
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.
Coding & AlgorithmsTechnical ScreenGreedySortingOptimization - NVIDIAEasySoftware EngineerFind the nth prime number
This question assesses algorithmic problem-solving and number-theoretic computation skills, requiring efficient prime generation and complexity analysis in the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - NVIDIAHardData ScientistImplement CUDA-tiled matrix multiplication and explain architecture
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.
Coding & AlgorithmsHR Screen - NVIDIAMediumSoftware EngineerImplement core graph algorithms for graphics
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.
Coding & AlgorithmsOnline Assessment - NVIDIAHardSoftware EngineerImplement short algorithms on logs, grids, and strings
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.
Coding & AlgorithmsOnsiteDynamic ProgrammingStackBacktracking - NVIDIAMediumData EngineerMerge Overlapping Time Intervals
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.
Coding & AlgorithmsTechnical Screen - NVIDIAMediumSoftware EngineerNormalize an Absolute Unix-Style File Path to Canonical Form
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.
Coding & AlgorithmsOther - NVIDIAHardData ScientistOptimize CUDA GEMM with tiling and coalescing
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.
Coding & AlgorithmsHR Screen - NVIDIAMediumSoftware EngineerReconstruct tree from inorder and postorder
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.
Coding & AlgorithmsTechnical Screen - NVIDIAEasySoftware EngineerReturn all file paths via DFS
This question evaluates understanding of tree traversal and depth-first search along with competence in handling hierarchical data structures and constructing full file paths.
Coding & AlgorithmsTechnical Screen - NVIDIAHardData ScientistReverse linked lists, including k-group
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.
Coding & AlgorithmsHR Screen - NVIDIAMediumSoftware EngineerSolve anagram grouping and in-place allocator
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.
Coding & AlgorithmsTechnical ScreenHash MapsString ManipulationTwo Pointers - NVIDIAMediumSoftware EngineerSolve small string and API tasks
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.
Coding & AlgorithmsOnsiteStackStringsAPI - NVIDIAMediumSoftware EngineerSolve unique triplets summing to target
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.
Coding & AlgorithmsTechnical Screen - Nash AIMediumSoftware EngineerImplement Minesweeper click and print
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.
Coding & AlgorithmsTechnical Screen - Nash AIMediumSoftware EngineerImplement Minesweeper click-to-reveal expansion
This problem tests your ability to implement recursive traversal (flood-fill) on a 2D grid and manage game state transitions based on player input.
Coding & AlgorithmsTechnical ScreenDFSBFSMatrix - NebiusMediumSoftware EngineerSolve four coding problems
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.
Coding & AlgorithmsOnline Assessment - NetappMediumSoftware EngineerIdentify the Orchestrator in a Server Connection Graph
This problem tests graph theory fundamentals by identifying a central hub node in a star-topology network using adjacency properties.
Coding & AlgorithmsOnsiteGraph TheoryData StructuresAlgorithms - NetappMediumSoftware EngineerMerge Two Sorted Singly Linked Lists
This problem tests the ability to manipulate pointers in a singly linked list to perform an in-place merge of two sorted lists.
Coding & AlgorithmsOnsiteLinked ListsPointersRecursion - NetappMediumSoftware EngineerRank Teams from Ballot Preferences
This problem tests your ability to manage multi-level sorting criteria by implementing custom comparison logic for an array of preference rankings.
Coding & AlgorithmsOnsiteSortingHash MapGreedy - NetflixMediumSoftware EngineerAnalyze Overlap in Closed Intervals
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.
Coding & AlgorithmsTechnical Screenbinary-searchintervalssweep-line - NetflixHardSoftware EngineerCompute Earliest Completion Times
This question evaluates understanding of directed acyclic graphs, dependency resolution, computation of earliest task completion times, and cycle detection within prerequisite relationships.
Coding & AlgorithmsOnsite - NetflixEasySoftware EngineerCompute Minimum Broadcast Latencies Between Cities
Implement Dijkstra's algorithm to compute the minimum broadcast latency from a source city to all other cities in an undirected, weighted network.
Coding & AlgorithmsTechnical Screengraphdijkstrashortest-path - NetflixMediumSoftware EngineerCompute Minimum Task Completion Time
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.
Coding & AlgorithmsTechnical ScreenGraphTopological SortDynamic Programming
NVIDIA
Netflix