Coding & Algorithms interview questions

Showing 3091–3120 of 3276 results

• Find users with access to all camerasMedium

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

  VerkadaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement LRU and LFU cachesMedium

  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.

  VerkadaSoftware EngineerCoding & AlgorithmsOnsite
• Implement WordGuess feedback scoringHard

  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.

  VerkadaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a recency cache and min-coins DPMedium

  This problem tests your ability to combine a Least Recently Used (LRU) cache mechanism with a dynamic programming approach for optimization.

  VerkadaFrontend EngineerCoding & AlgorithmsOnsite
• Intersect Motion Threshold Periods Across CamerasHard

  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.

  VerkadaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge Sorted Arrays In PlaceMedium

  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.

  VerkadaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Validate a 9×9 grid under constraintsMedium

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

  VerkadaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Connect Four Winner DetectionMedium

  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.

  Virtu FinancialData ScientistCoding & AlgorithmsTechnical Screen
• Maximize Points by Buying Cost-Multiplier CardsMedium

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

  Virtu FinancialData ScientistCoding & AlgorithmsTechnical Screen
• Maximum Edges in a Triangle-Free GraphHard

  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.

  Virtu FinancialQuantitative ResearcherCoding & AlgorithmsOnsite
• Maximum Total Height of Mountain-Shaped Towers Under Per-Plot Height CapsHard

  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.

  Virtu FinancialQuantitative ResearcherCoding & AlgorithmsOnline Assessment
• Minimum Number of Transfers to Settle All Debts in a GroupHard

  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.

  Virtu FinancialQuantitative ResearcherCoding & AlgorithmsOnline Assessment
• Reach a Target Pair by Repeatedly Adding One Coordinate to the OtherHard

  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.

  Virtu FinancialQuantitative ResearcherCoding & AlgorithmsOnline Assessment
• Solve Four Online Assessment Coding TasksMedium

  Determine the maximum number of contiguous, non-empty subarrays an array can be partitioned into such that each subarray has the same sum.

  Virtu FinancialSoftware EngineerCoding & AlgorithmsOnline Assessment
• Compute distinct sums from limited coinsMedium

  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.

  VisaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Connected Groups in a Relationship MatrixMedium

  Determine the number of connected components in an undirected graph represented by an adjacency matrix, accounting for transitive relationships.

  VisaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count Cross-Array Pairs with a Target SumMedium

  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.

  VisaSoftware Engineer ICoding & AlgorithmsOnline Assessment
• Count Islands in a Binary GridMedium

  This problem tests graph traversal techniques on a 2D grid, focusing on identifying connected components without modifying the original input or exceeding recursion limits.

  VisaSoftware Engineer ICoding & AlgorithmsOnline Assessment
• Count Space-Separated Words Made Only of Letters and Basic PunctuationMedium

  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.

  VisaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count Subsequences That Move Between PositionsHard

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

  VisaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design rotating warehouse simulator with closuresMedium

  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.

  VisaSoftware EngineerCoding & AlgorithmsOnsite
• Earliest K-Minute Meeting Start from Text Schedules with Inclusive Busy TimesMedium

  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.

  VisaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find the Index of a Target in a Sorted Array of Distinct IntegersMedium

  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.

  VisaSoftware EngineerCoding & AlgorithmsOnsite
• Find the Minimum Edge Score on a Path Between Two CitiesMedium

  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.

  VisaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find the Shortest Distance in a Weighted Undirected GraphMedium

  This problem tests the implementation of Dijkstra's algorithm using a priority queue to find the shortest path in a weighted undirected graph.

  VisaSoftware Engineer ICoding & AlgorithmsOnline Assessment
• Longest Strictly Rising Four-Direction Walk in an Integer GridMedium

  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.

  VisaSoftware EngineerCoding & AlgorithmsOnsite
• Maintain pair-sum counts under replacementsMedium

  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.

  VisaSoftware EngineerCoding & AlgorithmsOnsite
• Maximize Index-Weighted Array Sum When Each Element Swaps at Most OnceMedium

  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.

  VisaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Shortest Prefix of a Digit String That Can Build Every Permutation of a TargetMedium

  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.

  VisaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve Three Array Coding ProblemsMedium

  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.

  VisaSoftware EngineerCoding & AlgorithmsOnline Assessment