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 1621–1650 of 2629 results
- 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 - 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 - 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 - 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 - 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 - NetflixHardSoftware EngineerCompute subtree sums with tree DFS
This question evaluates proficiency in tree traversal and aggregation techniques, specifically computing subtree sums using depth-first search while handling traversal state and constraints such as negative values and large n.
Coding & AlgorithmsOnsite - NetflixMediumSoftware EngineerCount Pairs of Strings with Disjoint Character Sets
Tests bitmask representation of character sets, frequency-based pair counting, and handling edge cases like empty strings.
Coding & AlgorithmsTechnical ScreenBit ManipulationHash TableString - NetflixHardSoftware EngineerDesign command executor with undo
This problem tests the application of the Command design pattern and stack-based data structures to manage reversible operations in an application state.
Coding & AlgorithmsTechnical ScreenDesign PatternsStacksCommand Pattern - NetflixMediumSoftware EngineerFind longest run of identical consecutive shows
This question tests the ability to track state while iterating through an array to identify the longest contiguous sub-sequence of identical elements.
Coding & AlgorithmsTechnical ScreenArraysIterationAlgorithms - NetflixMediumSoftware EngineerFind longest unique show window
This question evaluates concepts in sliding-window algorithms, hash-based duplicate tracking, case-insensitive string handling, and the extension of batch solutions to streaming (online) inputs.
Coding & AlgorithmsTechnical Screen - NetflixMediumSoftware EngineerFind the Longest Run of One Character
Tests linear scan and two-pointer/state-tracking techniques to find the maximum number of consecutive identical characters in an ASCII string using constant auxiliary space.
Coding & AlgorithmsTechnical Screenstringstwo-pointerslinear-scan - NetflixMediumSoftware EngineerFind the Longest Substring Without Repeated Characters
Tests sliding window technique, hash map index tracking, and linear-time constraint optimization on string manipulation.
Coding & AlgorithmsTechnical ScreenSliding WindowTwo PointersHash Table - NetflixMediumSoftware EngineerGroup users by same last K watched movies
This question evaluates competency in set operations, grouping via maps/dictionaries, and algorithmic complexity analysis when comparing suffixes of ordered lists.
Coding & AlgorithmsOnline Assessment - NetflixMediumSoftware EngineerImplement Cache, Undo, and DFS
This problem tests your ability to combine a Least Recently Used (LRU) cache with a command-based undo system, applied to a hierarchical tree structure traversal.
Coding & AlgorithmsOnsiteLRU CacheDFSUndo Pattern - NetflixMediumSoftware EngineerImplement Caches, Undo, and Traversal
This question evaluates proficiency with data structures, API design, and system-level concerns by combining timed in-memory caching, command undo/redo semantics, and depth-first traversal of a tree; it falls under the Coding & Algorithms domain and is commonly asked to assess practical implementation skills, correctness under edge cases, and the ability to reason about time and space complexity. The level of abstraction spans practical application—designing clean APIs and implementing core logic—while also requiring conceptual understanding of complexity analysis and background cleanup or state-management patterns.
Coding & AlgorithmsOnsite - NetflixMediumSoftware EngineerImplement TTL Cache and Tree Balance Reporting
This question evaluates proficiency in designing efficient in-memory data structures and tree algorithms, specifically time-to-live cache behavior (expiration semantics and accurate unexpired counts) and per-node subtree-height computations for balance reporting, and it falls under the Coding & Algorithms domain.
Coding & AlgorithmsOnsite
NVIDIA
Netflix