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 1591–1620 of 1706 results

  • ValonMediumSoftware Engineer
    Design an In-Memory Database

    This question evaluates a candidate's skills in data modeling, in-memory data structures, index design, and query/filter semantics for a flexible schema-less record store.

    Coding & AlgorithmsTechnical Screen
  • ValonHardSoftware Engineer
    Implement an In-Memory Query Engine

    Design and implement an in-memory query engine capable of ingesting records and executing structured queries with comparison, membership, and logical operators.

    Coding & AlgorithmsTechnical ScreenData StructuresDesignRecursion
  • ValonHardSoftware Engineer
    Implement an in-memory SQL-like table

    This problem tests your ability to design a flexible, in-memory table structure that supports dynamic schema definition, data storage, and basic relational query operations.

    Coding & AlgorithmsTechnical ScreenData StructuresAPI DesignAlgorithms
  • VantaMediumSoftware Engineer
    Design streaming test logger and queries

    This question evaluates a candidate's ability to design streaming data structures and time-series algorithms to track state transitions and compute interval queries, covering competencies in online/event-processing algorithms, interval overlap aggregation, and algorithmic complexity analysis within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • VantaMediumSoftware Engineer
    Design test-run logging and query functions

    This question evaluates proficiency in time-series logging, event-driven state transitions, interval and sliding-window algorithms, and efficient data-structure design for streaming updates.

    Coding & AlgorithmsTechnical Screen
  • VercelMediumSoftware Engineer
    Count Hits in the Past Five Minutes

    Implement a five-minute hit counter with ordered timestamped operations, repeated hits, and an explicit 300-second expiration boundary.

    Coding & AlgorithmsTechnical Screen
  • VerkadaHardSoftware Engineer
    Find and Merge Camera Alert Intervals

    This question evaluates understanding of time-series processing, interval detection, and interval-merging algorithms, including handling thresholds, touching intervals, and open-ended alerts.

    Coding & AlgorithmsTechnical Screen
  • VerkadaMediumSoftware Engineer
    Find motion intervals above threshold

    This question evaluates understanding of time-series data processing and interval detection, focusing on grouping timestamped motion readings that exceed a numeric threshold and managing contiguous active segments.

    Coding & AlgorithmsTechnical Screen
  • VerkadaMediumSoftware Engineer
    Find the Super Admin User Who Can Access Every Camera Through Nested Groups

    Given permission triples linking users, groups and cameras, find the user who can access every camera through direct ownership or through nested, possibly cyclic group memberships. It tests modeling permissions as a directed graph, reachability that tolerates membership cycles, and edge cases such as an input with no cameras or a group that covers everything.

    Coding & AlgorithmsTechnical Screen
  • VerkadaMediumSoftware Engineer
    Find users with access to all cameras

    This question evaluates understanding of graph modeling and traversal techniques, particularly transitive closure, cycle detection, and BFS-based permission propagation across nested group relationships.

    Coding & AlgorithmsTechnical Screen
  • VerkadaHardSoftware Engineer
    Implement WordGuess feedback scoring

    This question evaluates proficiency in string processing, frequency counting, and edge-case handling by requiring implementation of Wordle-like feedback scoring for guess versus secret words.

    Coding & AlgorithmsTechnical Screen
  • VerkadaHardSoftware Engineer
    Intersect Motion Threshold Periods Across Cameras

    Find maximal motion periods for one camera or the simultaneous intersection across many piecewise-constant camera streams. The prompt defines exact integer timestamps, threshold scaling, last-reading horizon, undefined prefixes, inclusive endpoints, and deterministic interval ordering for portable console verification.

    Coding & AlgorithmsTechnical Screen
  • VerkadaMediumSoftware Engineer
    Merge Sorted Arrays In Place

    This question evaluates array manipulation and in-place merging skills, specifically understanding sorted sequences, pointer/index management, and space-time trade-offs within array algorithms, and it falls under the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • VerkadaMediumSoftware Engineer
    Validate a 9×9 grid under constraints

    This problem tests your ability to validate a 9x9 grid against Sudoku-like constraints using efficient lookups and index arithmetic.

    Coding & AlgorithmsTechnical ScreenArraysMatrixHash Sets
  • Virtu FinancialMediumData Scientist
    Implement Connect Four Winner Detection

    This question evaluates the ability to design and implement game-state logic for a Connect Four-style board, covering board data structures, coordinate and boundary handling, gravity-based token placement, and efficient pattern detection for consecutive tokens in the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • Virtu FinancialMediumData Scientist
    Maximize Points by Buying Cost-Multiplier Cards

    This problem tests your ability to determine an optimal ordering strategy and apply dynamic programming to maximize a cumulative score subject to specific operations.

    Coding & AlgorithmsTechnical ScreenDynamic ProgrammingGreedyOptimization
  • VisaMediumSoftware Engineer
    Compute distinct sums from limited coins

    This question evaluates algorithmic problem-solving skills in combinatorics and resource-constrained subset-sum computation, focusing on dynamic programming, optimization, and complexity analysis within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • VisaHardSoftware Engineer
    Count Subsequences That Move Between Positions

    This problem tests dynamic programming skills, specifically the ability to count subsequences that satisfy a positional movement constraint based on element parity.

    Coding & AlgorithmsTechnical ScreenDynamic ProgrammingMathArrays
  • VmwareMediumSoftware Engineer
    Compute iterative sliding-window sum reduction

    This question tests the ability to implement a sliding window algorithm to compute dynamic reductions, focusing on efficient array traversal and state maintenance.

    Coding & AlgorithmsTechnical ScreenSliding WindowAlgorithmsArray
  • VoleonMediumSoftware Engineer
    Advance Cyclic Ball Flips Efficiently

    Calculate the final binary states of cyclic nodes visited by multiple advancing markers in O(n + m) time using interval difference arrays and modular arithmetic.

    Coding & AlgorithmsTechnical ScreenPrefix SumArraysMath
  • VoleonMediumSoftware Engineer
    Count queen attacks on points with blockers

    This question evaluates spatial reasoning on an integer 2D grid, geometric line relationships for queens' attack paths, and the use of efficient data structures to count interactions and handle occlusion, in the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • VoleonMediumSoftware Engineer
    Design circular sliding-window ratio tracker

    This question evaluates proficiency with sliding-window techniques, handling of circular arrays and modular indexing, design of constant-time update mechanisms, and rigorous algorithmic time/space complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • VoleonMediumSoftware Engineer
    Implement sparse matrix addition and multiplication

    This question evaluates implementation skills for sparse matrix addition and multiplication, focusing on data structure selection, algorithmic complexity, memory efficiency, and explicit error handling within the Coding & Algorithms domain and the linear algebra/data-structures crossover.

    Coding & AlgorithmsTechnical Screen
  • VoleonMediumQuantitative Researcher
    Return Words in Repeated Anagram Groups

    Return all input occurrences belonging to repeated anagram groups, preserving order and duplicates with multiplicity-aware letter-count signatures.

    Coding & AlgorithmsTechnical Screen
  • VoleonMediumSoftware Engineer
    Simulate an exchange and participation-rate trading

    This question evaluates competency in designing and implementing event-driven simulators, priority-based matching algorithms, and quota-constrained allocation for a limit order book, participation-rate execution, and multi-client fair-share distribution in the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • VoleonHardSoftware Engineer
    Solve classic coding interview problems

    Determine the minimum number of trials needed to find the highest safe floor in an n-story building using at most k eggs in the worst case.

    Coding & AlgorithmsTechnical ScreenDynamic ProgrammingBinary SearchCombinatorics
  • VoleonMediumSoftware Engineer
    Validate whether a binary string is good

    This question evaluates understanding of recursive grammars and string parsing, focusing on designing linear-time algorithms and managing space constraints for validity checks on binary strings.

    Coding & AlgorithmsTechnical Screen
  • Walmart LabsMediumSoftware Engineer
    Check whether brackets are balanced

    This problem tests your ability to handle nested structures using a stack data structure to track opening symbols and verify matching closing symbols.

    Coding & AlgorithmsTechnical ScreenStackString ManipulationData Structures
  • Walmart LabsMediumSoftware Engineer
    Compute days until plants stop dying

    This question evaluates a candidate's ability to reason about array-based state transitions and algorithmic complexity, testing competency in analyzing iterative dependencies among elements and handling large input sizes.

    Coding & AlgorithmsTechnical Screen
  • Walmart LabsMediumSoftware Engineer
    Compute the Minimum Number of Meeting Rooms

    Determine the minimum number of meeting rooms required to accommodate a set of schedule intervals where intervals are half-open and meetings can start at the exact moment another ends.

    Coding & AlgorithmsTechnical Screenintervalssortingheap