Katkat

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 2491–2520 of 2629 results

  • 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 FinancialMediumSoftware Engineer
    Solve 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 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
  • VisaMediumSoftware Engineer
    Count 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
    Count 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 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
  • VisaMediumSoftware Engineer
    Design 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 Engineer
    Earliest 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 Engineer
    Find 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 Engineer
    Find 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
    Longest 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 Engineer
    Maintain 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 Engineer
    Maximize 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 Engineer
    Shortest 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 Engineer
    Solve 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
  • 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
  • VoleonHardSoftware Engineer
    Implement Kac ring with O(1) color and kstep

    This question evaluates understanding of algorithmic state representation, modular arithmetic, and efficient update/query design by requiring a Kac ring implementation that supports constant-time k-step advancement and O(1) aggregate color reporting.

    Coding & AlgorithmsOnsite
  • 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
  • VoleonHardSoftware Engineer
    Process exchange prints, volume checks, and client orders

    This problem tests your ability to manage high-frequency time-series data using sliding windows and stateful order tracking to enforce trading constraints.

    Coding & AlgorithmsOnsiteSliding WindowStream ProcessingTime-Series
  • 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
  • Walmart LabsMediumSoftware Engineer
    Count ways to make change (DP)

    This problem tests the ability to solve the classic 'Coin Change II' problem using dynamic programming to count the number of unique combinations that sum up to a target amount.

    Coding & AlgorithmsTechnical ScreenDynamic ProgrammingCombinatoricsOptimization
  • Walmart LabsMediumSoftware Engineer
    Find shared courses between student pairs

    This problem tests your ability to efficiently map relationships and compute intersections between multiple sets to identify commonalities across pairs.

    Coding & AlgorithmsTechnical ScreenHash MapSetData Structures