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 571–600 of 2629 results
- Capital OneMediumSoftware EngineerGrid State After a Given Number of Days of Spoilage Spreading to Neighbors
A grid holds empty cells, fresh items and spoiled items, and each day spoilage spreads from every spoiled item to its edge-adjacent fresh neighbors. Given the grid and a number of days that may be very large, return the grid after exactly that many days. It tests simultaneous multi-source spreading, day-by-day timing, and unreachable cells.
Coding & AlgorithmsHR Screen - Capital OneMediumSoftware EngineerImplement 2D transforms and find max-lit point
This question evaluates array-manipulation and interval-analysis skills, specifically in-place 2D matrix transformations (row/column swaps, reversals, rotations) and determining the point with maximum overlap among one-dimensional illumination intervals.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerImplement deposit, withdraw, and transfer in a class
This question evaluates a candidate's competence in concurrent programming, atomic state updates, and class-level account management for basic monetary operations.
Coding & AlgorithmsOnsite - Capital OneMediumSoftware EngineerPlace Pieces on a Grid
This question evaluates spatial reasoning, matrix and array manipulation, collision detection, and stateful simulation skills required to implement ordered placement of shaped pieces on a grid.
Coding & AlgorithmsOnsite - Capital OneMediumSoftware EngineerRemove nodes with a given value
This problem tests your ability to manipulate singly linked lists, specifically handling edge cases like removing head nodes and reassigning pointers in a single pass.
Coding & AlgorithmsTechnical ScreenLinked ListPointersRecursion - Capital OneHardSoftware EngineerReorder a String by Alternating Its Front and Back Characters
Rearrange a string by taking characters alternately from its front and its back: first, last, second, second-to-last and so on until every character is used once. Tests clean index handling for even and odd lengths and building the result efficiently for long inputs.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerReorder a String by Alternating Its Left and Right Ends
This problem tests string manipulation, two-pointer logic, and the ability to efficiently manage index traversal in both directions simultaneously.
Coding & AlgorithmsOnline AssessmentTwo PointersStringsAlgorithms - Capital OneMediumSoftware EngineerReturn the Top Two Teams by Points, Goal Difference, and Tie Breakers
Implement a ranking algorithm to evaluate sports competition matches, compute points, goal differential, and total goals for each team, and return the indices of the top two teams using multi-level tie-breakers.
Coding & AlgorithmsOnline AssessmentSortingHash TableArray - Capital OneMediumSoftware EngineerSimulate Rot Spreading Through an Orchard Grid Over a Number of Days
A grid simulation question about an orchard of rotten trees, healthy trees and empty ground, where each day rot spreads at once from every rotten tree to the healthy trees directly beside it. It asks for the orchard after a given number of days and tests simultaneous updates, blocked cells and very large day counts.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerSimulate a Bank Ledger With Validated Transfers, Deposits and Withdrawals
A coding exercise that simulates a bank's in-memory ledger: apply an ordered sequence of transfers, deposits and withdrawals across numbered accounts and report which requests succeed. It tests careful validation of account numbers and balances, ordered state updates, and 64-bit arithmetic.
Coding & AlgorithmsOther - Capital OneMediumSoftware EngineerSolve four algorithmic coding tasks
This multi-part question evaluates algorithmic problem-solving across frequency counting (equal-value pairs), simulation and in-place grid transformation (match-three gravity), matrix diagonal pattern checking, and interval/range data-structure management, emphasizing correctness under constraints and rigorous time/space complexity reasoning.
Coding & AlgorithmsOnline Assessment - Capital OneHardSoftware EngineerSolve multiple algorithmic interview questions
This multi-part prompt evaluates algorithmic problem-solving and core data-structure competencies such as array manipulation, modular/date arithmetic, matrix transformations, dynamic set and interval maintenance, string concatenation frequency counting, and path-based expression evaluation on grids.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerSort Each Adjacent Pair of an Array, Leaving an Odd Last Element in Place
Given an integer array, put each consecutive pair of elements in ascending order while keeping every pair in its original place, and leave the final element untouched when the length is odd. Tests precise reading of a short specification and careful index handling.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerSort Every Concentric Matrix Border Clockwise
This problem tests array traversal, boundary management, and sorting logic by requiring you to isolate concentric layers of a matrix and sort their contents independently.
Coding & AlgorithmsOnline AssessmentArraysSortingMatrix - Capital OneMediumSoftware EngineerSort Matrix Diagonals By Their Values
Tests matrix traversal along anti-diagonals, string formation, and custom multi-key sorting with deterministic tie-breaking.
Coding & AlgorithmsTechnical Screenmatrixsortingstrings - Capital OneMediumSoftware EngineerSorted Sums of Absolute Differences Over All Cyclic Shifts of an Array
Given two integer arrays of equal length, compute the sum of absolute differences between the second array and every cyclic rotation of the first, then return all of these sums in non-descending order. It tests rotation index arithmetic, accumulation over every shift, and exact output ordering.
Coding & AlgorithmsOnline Assessment - Capital OneHardSoftware EngineerSum of Distinct Values on the Borders of All Maximum-Sum Square Frames
Among all square frames of a given size inside an integer matrix, find those with the largest border sum, then add up the distinct values that appear on the borders of every such frame. Tests careful border enumeration that excludes interior cells, tie handling across several frames, and de-duplication by value.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerTop Two Teams by Points, Then Goal Difference, Then Goals Scored
Given parallel arrays of wins, draws, goals scored and goals conceded for each team, compute points as three per win plus one per draw and return the indices of the top two teams. Ties are broken by goal difference, then goals scored, then index, testing multi-key comparison and careful tie handling.
Coding & AlgorithmsHR Screen - CarvanaEasySoftware EngineerSpell Out a Nonnegative Integer
This question evaluates a candidate's ability to decompose integers and implement precise string-formatting logic, including mapping numeric values to their English word equivalents and managing scale units and boundary conditions.
Coding & AlgorithmsOnsite - CerebrasMediumSoftware EngineerImplement Binary Search in C++
This question evaluates proficiency in implementing binary search in C++, focusing on iterative control flow, correct handling of not-found cases, boundary conditions, and understanding of algorithmic correctness.
Coding & AlgorithmsTechnical Screen - CerebrasMediumSoftware EngineerImplement and Optimize Vector Multiplication
This question evaluates a candidate's ability to implement vector–vector multiplication and to reason about performance optimizations and sparse data structures, assessing competencies in algorithm design, parallel computing, memory hierarchy, and numerical operations.
Coding & AlgorithmsTechnical Screen - ChalkMediumSoftware EngineerCompute rainwater accumulation on a height grid
Tests the ability to simulate 2D fluid accumulation using priority-queue-based graph traversal (similar to Dijkstra's algorithm) to track spilling boundaries.
Coding & AlgorithmsTechnical Screenheapbfsgraph - Character.AIMediumSoftware EngineerFind Shortest Covering Substring
This problem tests your ability to use the sliding window technique and hash maps to find the smallest window in a string that contains all characters of a target pattern.
Coding & AlgorithmsTechnical ScreenSliding WindowHash MapTwo Pointers - ChariotMediumSoftware EngineerExplore an HTTP Maze
This question evaluates the ability to integrate HTTP-based APIs with graph traversal and state management, covering concepts such as breadth-first exploration for shallow-first search, cycle avoidance, transient error handling, and key-lock resource constraints.
Coding & AlgorithmsTechnical Screen - Chicago Trading CompanyMediumSoftware EngineerBuild an Ordered Latest-Quote Container
Build an insertion-ordered container that stores only the latest quote for each stock symbol. Support expected O(1) push, pop, and size operations while updating bid and ask values without changing a symbol's original position and safely rejecting malformed commands.
Coding & AlgorithmsTechnical Screen - Chicago Trading CompanyMediumSoftware EngineerImplement a Constant-Time Simple Moving Average
Implement a fixed-window simple moving average with O(1) processing for every valid add and query. Maintain a rolling sum and bounded queue, average the samples available before the window fills, and return deterministic results for empty, malformed, or unknown operations.
Coding & AlgorithmsTechnical Screen - Chicago Trading CompanyEasySoftware EngineerMerge Nested Dictionaries Iteratively
This question evaluates a candidate's skill in iterative data structure manipulation and handling of nested dictionary merging semantics, including conflict resolution and value overriding.
Coding & AlgorithmsOnline Assessment - ChimeMediumSoftware EngineerImplement single-tab browser history navigation
This question evaluates understanding of data structures, stateful API behavior, amortized time complexity, set membership tracking, and edge-case handling for implementing browser-like history navigation in the coding & algorithms domain.
Coding & AlgorithmsTechnical Screen - ChimeMediumSoftware EngineerSimulate toppling board game outcome
This question evaluates a candidate's ability to implement a discrete board-game simulation, including state management, turn-based ownership semantics, stack-based piece handling, capture mechanics, and game termination detection.
Coding & AlgorithmsOnsite - CircleHardSoftware EngineerImplement Recipe Storage CRUD
This question evaluates the ability to design and implement in-memory data structures and APIs for CRUD operations, covering skills such as ID generation and parsing, string handling for case-insensitive uniqueness constraints, data modeling, and preserving original value casing.
Coding & AlgorithmsTechnical Screen
Capital One
Cerebras
Chime
Circle