Katkat

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 961–990 of 1706 results

  • NVIDIAMediumSoftware Engineer
    Find 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 Engineer
    Find 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 Engineer
    Find 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
  • NVIDIAMediumData Engineer
    Merge 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 Engineer
    Reconstruct 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 Engineer
    Return 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 Engineer
    Solve 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 Engineer
    Solve 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 Engineer
    Implement 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 Engineer
    Implement 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
  • NetflixMediumSoftware Engineer
    Analyze 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
  • NetflixEasySoftware Engineer
    Compute 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 Engineer
    Compute 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
  • NetflixMediumSoftware Engineer
    Count 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 Engineer
    Design 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 Engineer
    Find 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 Engineer
    Find 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 Engineer
    Find 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 Engineer
    Find 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
  • NetflixMediumMachine Learning Engineer
    Implement Streaming Word Counter

    This question evaluates streaming data processing, string tokenization, and frequency-aggregation competencies, focusing on maintaining accurate counts over incremental text inputs using associative data structures.

    Coding & AlgorithmsTechnical Screen
  • NetflixHardData Engineer
    Implement a Weighted Eviction Cache

    This problem tests your ability to design a cache that respects both memory capacity and item weights, requiring an efficient combination of a hash map and a doubly linked list.

    Coding & AlgorithmsTechnical ScreenHash MapDoubly Linked ListLRU Cache
  • NetflixMediumSoftware Engineer
    Implement weighted-eviction cache

    This question evaluates understanding and practical implementation of data structures and algorithms for a weighted cache, including weighted eviction policies, use of ordered maps, and time-space complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • NetflixMediumSoftware Engineer
    Return the longest contiguous subarray with all distinct values

    This problem tests your ability to use the sliding window pattern and a hash map to maintain a range of unique elements efficiently in O(n) time.

    Coding & AlgorithmsTechnical ScreenSliding WindowHash MapArrays
  • NetflixMediumSoftware Engineer
    Simulate a TTL Cache with LRU Eviction

    Implement a fixed-capacity key-value cache combining per-key TTL expiration with LRU eviction and O(1) average time per operation.

    Coding & AlgorithmsTechnical ScreenCacheLRUHash Table
  • NetflixMediumSoftware Engineer
    Solve non-repeating show substring

    This question evaluates understanding of sequence processing, uniqueness detection, and the use of auxiliary data structures to track previously seen elements when finding non-repeating contiguous subsequences, applied to show names instead of characters.

    Coding & AlgorithmsTechnical Screen
  • NetflixMediumSoftware Engineer
    Solve sliding-window and disjoint-string-pairs tasks

    This question tests the ability to combine sliding window techniques with bit manipulation or frequency counting to identify pairs of substrings that share no common characters.

    Coding & AlgorithmsTechnical ScreenStringsBit ManipulationSliding Window
  • NewrelicHardSoftware Engineer
    Maximum Path Sum in an Indexed Binary Tree

    This problem tests tree traversal techniques on an index-based representation, focusing on handling negative weights and memory efficiency via an iterative post-order approach.

    Coding & AlgorithmsTechnical ScreenBinary TreeDynamic ProgrammingIterative Traversal
  • NewrelicHardSoftware Engineer
    Product of Array Except Self Without Division

    This problem tests array manipulation skills and the ability to optimize space complexity by using prefix and suffix product passes instead of division.

    Coding & AlgorithmsTechnical ScreenArraysPrefix-SumOptimization
  • NextdoorMediumMachine Learning Engineer
    Build Ranked Feed With Photo Batching

    This question evaluates algorithmic reasoning and data manipulation skills, including stable sorting, grouping/batching, and merging of ranked items while preserving ordering invariants.

    Coding & AlgorithmsTechnical Screen
  • NextdoorEasyiOS Engineer
    Flatten Nested Comments

    This problem tests your ability to traverse a nested tree structure (comments) and flatten it into a linear representation while respecting hierarchical depth levels.

    Coding & AlgorithmsTechnical ScreenTreesRecursionData Structures