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 3091–3120 of 3276 results
- VerkadaMediumSoftware EngineerFind 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 - VerkadaMediumSoftware EngineerImplement LRU and LFU caches
This question evaluates understanding of cache eviction policies and data structure design, focusing on LRU and LFU semantics and the ability to support O(1) average-time get/put operations.
Coding & AlgorithmsOnsite - VerkadaHardSoftware EngineerImplement 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 - VerkadaMediumFrontend EngineerImplement a recency cache and min-coins DP
This problem tests your ability to combine a Least Recently Used (LRU) cache mechanism with a dynamic programming approach for optimization.
Coding & AlgorithmsOnsiteHash MapDoubly Linked ListDynamic Programming - VerkadaHardSoftware EngineerIntersect 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 EngineerMerge 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 EngineerValidate 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 ScientistImplement 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 ScientistMaximize 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 - Virtu FinancialHardQuantitative ResearcherMaximum Edges in a Triangle-Free Graph
Determine the maximum number of edges an undirected, simple graph on n vertices can have without containing any triangle (K3), and construct one such extremal graph.
Coding & AlgorithmsOnsitegraph-theorymathcombinatorics - Virtu FinancialHardQuantitative ResearcherMaximum Total Height of Mountain-Shaped Towers Under Per-Plot Height Caps
Each plot in a row has a maximum allowed tower height. Choose tower heights that rise to a single peak and then fall, never exceeding any cap, so that the total height is as large as possible. Tests reasoning about the peak position, per-position caps, and 64-bit sums.
Coding & AlgorithmsOnline Assessment - Virtu FinancialHardQuantitative ResearcherMinimum Number of Transfers to Settle All Debts in a Group
Given a list of past loans between people, compute the minimum number of new money transfers needed so that everyone's net balance returns to zero. Tests reducing a transaction log to net balances and searching for the fewest settling transfers under small input bounds.
Coding & AlgorithmsOnline Assessment - Virtu FinancialHardQuantitative ResearcherReach a Target Pair by Repeatedly Adding One Coordinate to the Other
Starting from a pair of positive integers, each move adds one coordinate to the other. Decide whether an exact target pair can be reached. Tests reasoning about reachability when values go up to one billion and simulating every forward move is far too slow.
Coding & AlgorithmsOnline Assessment - Virtu FinancialMediumSoftware EngineerSolve Four Online Assessment Coding Tasks
Determine the maximum number of contiguous, non-empty subarrays an array can be partitioned into such that each subarray has the same sum.
Coding & AlgorithmsOnline AssessmentPrefix SumGreedyMath - VisaMediumSoftware EngineerCompute 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 - VisaMediumSoftware EngineerCount Connected Groups in a Relationship Matrix
Determine the number of connected components in an undirected graph represented by an adjacency matrix, accounting for transitive relationships.
Coding & AlgorithmsOnline AssessmentGraphDFSBFS - VisaMediumSoftware Engineer ICount Cross-Array Pairs with a Target Sum
Tests linear-time frequency-map counting across two independent arrays to find pairs that sum to a target, properly accounting for duplicates and 64-bit integer overflow.
Coding & AlgorithmsOnline AssessmentHash TableArrayCounting - VisaMediumSoftware Engineer ICount Islands in a Binary Grid
This problem tests graph traversal techniques on a 2D grid, focusing on identifying connected components without modifying the original input or exceeding recursion limits.
Coding & AlgorithmsOnline AssessmentGraphsDFSBFS - VisaMediumSoftware EngineerCount Space-Separated Words Made Only of Letters and Basic Punctuation
A string-processing coding problem: split a sentence on spaces and count the tokens that contain only English letters and the punctuation marks comma, period, question mark and exclamation mark. It tests careful tokenization with repeated spaces and exact character-class rules.
Coding & AlgorithmsOnline Assessment - VisaHardSoftware EngineerCount 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 - VisaMediumSoftware EngineerDesign rotating warehouse simulator with closures
This question evaluates algorithmic skills in designing efficient dynamic data structures and performing event-driven simulation with mutable state, specifically managing cyclic capacity resets and permanent closures in the Coding & Algorithms domain.
Coding & AlgorithmsOnsite - VisaMediumSoftware EngineerEarliest K-Minute Meeting Start from Text Schedules with Inclusive Busy Times
A scheduling coding problem: given everyone's busy intervals as text entries with inclusive minute times, find the earliest start for a meeting of k minutes after the day's first busy minute, or report that none exists. It tests time parsing, merging overlapping intervals and off-by-one boundaries.
Coding & AlgorithmsOnline Assessment - VisaMediumSoftware EngineerFind the Index of a Target in a Sorted Array of Distinct Integers
Practice locating a target value in a strictly increasing array of distinct integers, returning its zero-based index or -1 when it is absent. The task checks logarithmic-time search over sorted data, precise loop boundaries, and correct handling of single-element arrays and values that fall between or outside the stored elements.
Coding & AlgorithmsOnsite - VisaMediumSoftware EngineerFind the Minimum Edge Score on a Path Between Two Cities
This problem tests the ability to optimize for the bottleneck edge in a path rather than the total path cost, typically solvable using a modified Dijkstra's algorithm or a Union-Find approach.
Coding & AlgorithmsOnline AssessmentGraphsDijkstraUnion-Find - VisaMediumSoftware Engineer IFind the Shortest Distance in a Weighted Undirected Graph
This problem tests the implementation of Dijkstra's algorithm using a priority queue to find the shortest path in a weighted undirected graph.
Coding & AlgorithmsOnline AssessmentGraphsDijkstraPriority Queue - VisaMediumSoftware EngineerLongest Strictly Rising Four-Direction Walk in an Integer Grid
A grid coding problem: find the length of the longest walk of strictly increasing values in an integer matrix, moving only up, down, left or right. It tests modeling a grid as a graph, handling equal neighboring values correctly, and an efficient search over grids of up to 40,000 cells.
Coding & AlgorithmsOnsite - VisaMediumSoftware EngineerMaintain pair-sum counts under replacements
This question evaluates the ability to design dynamic data structures and perform algorithmic complexity analysis for maintaining pair-sum counts under element replacements, testing skills in efficient query/update handling and scalability.
Coding & AlgorithmsOnsite - VisaMediumSoftware EngineerMaximize Index-Weighted Array Sum When Each Element Swaps at Most Once
An array optimization problem: maximize the sum of each element times its index when any two elements may be swapped but every element can take part in at most one swap. It tests modeling the at-most-once rule precisely and finding the best set of disjoint swaps within small input limits.
Coding & AlgorithmsOnline Assessment - VisaMediumSoftware EngineerShortest Prefix of a Digit String That Can Build Every Permutation of a Target
Given a digit string and a list of digit targets, return for each target the length of the shortest prefix whose characters could build every permutation of that target, or -1 if no prefix can. It tests character frequency counting, precomputation over a string, and answering many queries efficiently.
Coding & AlgorithmsOnline Assessment - VisaMediumSoftware EngineerSolve Three Array Coding Problems
This multi-part question evaluates algorithmic problem-solving skills in array manipulation, optimization (maximizing capped contributions), modular combinatorics (counting divisible-sum triplets), and sequence selection/dynamic decision-making for longest selectable non-decreasing subarrays.
Coding & AlgorithmsOnline Assessment
Verkada
Virtu Financial
Visa