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 541–570 of 2629 results
- ByteDanceMediumSoftware EngineerMinimize Increments to Equalize Path Costs
This problem tests your ability to manipulate tree node values to satisfy a global constraint using a bottom-up dynamic programming or greedy approach.
Coding & AlgorithmsTechnical ScreenTreesGreedyRecursion - ByteDanceMediumSoftware EngineerOrder Named Tasks by Dependencies, Choosing the Alphabetically Smallest Order
Given named tasks and before-and-after dependency pairs, return an order that satisfies every dependency, choosing the alphabetically smallest valid order, or an empty list when the dependencies contain a cycle. It tests topological sorting, cycle detection and deterministic tie-breaking.
Coding & AlgorithmsOnsite - ByteDanceMediumSoftware EngineerRemove Duplicate Letters Lexicographically
This problem tests your ability to use a monotonic stack combined with frequency tracking to construct a specific subsequence while maintaining lexicographical order.
Coding & AlgorithmsTechnical ScreenStackStringGreedy - ByteDanceMediumSoftware EngineerReport the winner after each move on an n-by-n tic-tac-toe board
Coding problem: replay an n-by-n tic-tac-toe game from a list of moves and report after every move whether the player who just moved has filled a row, a column or either diagonal. It tests efficient win detection on large boards and careful handling of diagonal and anti-diagonal cells.
Coding & AlgorithmsOnsite - ByteDanceEasySoftware EngineerReturn the Most Frequent Integer with a Stable Tie-Breaker
Implement a frequency-based selection over a large integer array: return the most common value, using the numerically smallest value to break ties. Preserve the input and return the value itself rather than its count or position.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerReverse Nodes in K-Sized Groups
This problem tests your ability to manipulate linked list pointers by reversing sub-segments of a list while maintaining structural integrity.
Coding & AlgorithmsTechnical ScreenLinked ListPointersRecursion - ByteDanceMediumSoftware EngineerRunning Median After Each Number in a Data Stream
Numbers arrive one at a time from a stream; after each arrival, return the median of everything received so far, averaging the two middle values when the count is even. The problem tests keeping order statistics up to date efficiently as a data stream grows.
Coding & AlgorithmsOnsite - ByteDanceMediumSoftware EngineerShortest Path in a Grid with Limited Obstacle Removal
This problem tests your ability to adapt Breadth-First Search (BFS) to a state-space graph where the state includes both spatial coordinates and a remaining resource constraint.
Coding & AlgorithmsTechnical ScreenBFSShortest PathState Space Search - ByteDanceHardSoftware EngineerSimulate a fixed-capacity least-recently-used cache over get and put operations
Implement a fixed-capacity cache that evicts the least recently used key, processing a sequence of get and put operations and returning the result of every get. Tests recency bookkeeping, update versus insert semantics, eviction order and constant-time operations.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerSolve Search Speed and String Product
This pair of problems evaluates algorithm design and implementation skills, focusing on efficient search/optimization for constrained processing speed and manual arbitrary-precision string multiplication for very large integers.
Coding & AlgorithmsOnsite - ByteDanceMediumSoftware EngineerSolve interval merging and histogram area
This question evaluates algorithmic problem-solving skills focused on interval manipulation and histogram-based area computation, emphasizing data structures, ordering, and reasoning about time and space complexity.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerSort Every Concentric Matrix Border Clockwise
Sort the values on every concentric border of a rectangular matrix and write them back clockwise from each border's top-left cell. Traverse corners exactly once, preserve interior layer boundaries, handle single-row or single-column centers, and leave the input unchanged.
Coding & AlgorithmsOnline Assessment - ByteDanceHardSoftware EngineerSplit n People Into Two Groups So No Pair Who Dislike Each Other Shares a Group
Given n people and a list of pairs who dislike each other, decide whether everyone can be divided into two groups of any size so that no disliking pair shares a group. The problem tests reasoning about pairwise constraints, people with no constraints, and a solution that runs in time linear in the number of people and pairs.
Coding & AlgorithmsTechnical Screen - C3 AIMediumSoftware EngineerMaximum-Sum Star with at Most K Arms
Find the maximum node-value sum of a graph star with at most k arms, allowing a center alone and avoiding harmful negative-value leaves.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerApply commands to transform a matrix
This question evaluates array and matrix manipulation skills, specifically in-place row reversal, row swapping, and 90-degree rotation, and falls under the Coding & Algorithms domain with emphasis on practical implementation.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerBlock-Building Operations: Check Whether a Free Segment Starts at a Position
Process operations on a number line that either place a block at a position or ask whether a segment of a given length starting at a position is free of blocks, and return the answers as a string of ones and zeros. It tests handling interleaved updates and range checks efficiently over large coordinates.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerBuild a Banking System with Activity Rankings
This problem tests your ability to design a system that maintains account state and dynamically updates an ordered leaderboard of account activity using efficient data structures.
Coding & AlgorithmsOnsiteHash MapBalanced BSTDesign - Capital OneMediumSoftware EngineerCheck Alternating Highs and Lows Around a Circular Array
Check strict high-low alternation around a circular array, including equal neighbors, wraparound comparisons, and the two-element case.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerCount Numbers With Odd Zeros
This question evaluates proficiency in numeric digit analysis and parity-based counting, testing the competency to reason about decimal representations of integers within the Coding & Algorithms domain at a practical application level. It is commonly asked to assess basic algorithmic thinking, efficient iteration and counting skills, and careful handling of edge cases in technical interviews.
Coding & AlgorithmsTechnical Screen - Capital OneMediumSoftware EngineerCount Pairs of Cyclically Equivalent Integers
This problem tests your ability to normalize strings under cyclic rotation using hashing or canonical representation, combined with frequency counting to efficiently identify equivalent pairs.
Coding & AlgorithmsOnline AssessmentHashingStringsCombinatorics - Capital OneMediumSoftware EngineerCount Pairs of Points Within 2 Units on Both Axes
A coding question that asks how many pairs of points intersect, where two points intersect when both their x-coordinates and their y-coordinates differ by at most 2. It tests counting unordered pairs with duplicate points, inclusive bounds and scaling to 100,000 points with large coordinates.
Coding & AlgorithmsOnline Assessment - Capital OneHardSoftware EngineerCount Subarrays Containing at Least k Disjoint Pairs of Equal Values
Count the contiguous segments of an integer array, framed as fruit types on a conveyor belt, that contain at least k pairs of equal values with no position used in two pairs. Tests reasoning about how the number of disjoint pairs changes as a segment grows, and efficient counting on inputs of up to 100,000 elements.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerCount Subarrays Whose Step-by-Step Changes Match an Up, Flat, Down Pattern
Count the fixed-length windows of an integer array whose consecutive rises, equal steps, and drops follow a given pattern of 1, 0, and -1 values, counting overlapping matches separately. Tests turning a comparison rule into an exact window check with correct index bounds.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerCount Three-Digit Numbers With All-Distinct Digits in a Range
A coding question that asks you to count the three-digit integers in an inclusive range whose hundreds, tens and units digits are all different from one another. It tests digit extraction, inclusive range boundaries and treating zero digits like any other digit.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerCount Windows That Follow an Increase, Equal, Decrease Pattern
A coding question that gives an integer array and a pattern of 1, 0 and -1 values standing for an increase, an equal step and a decrease, and asks how many windows of consecutive elements follow the pattern exactly. It tests translating pairwise comparisons into steps and counting overlapping matches efficiently.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerCount ordered pairs that concatenate to target
This question evaluates a candidate's ability to manipulate string and numeric representations, perform efficient counting, and leverage associative data structures to identify matching concatenations.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerFind Repeated-Value Patterns in a Matrix
Match a symbol pattern inside an integer matrix using per-window bijections, repeated values, distinct symbols, and ordered match coordinates.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerFind the First Array Element Smaller Than Both of Its Neighbors
A coding problem that asks for the first element of an integer array whose left and right neighbors are both strictly larger than it, returning -1 when no element qualifies. It tests careful boundary handling, strict comparisons when neighbors are equal, and precise output rules.
Coding & AlgorithmsOnline Assessment - Capital OneMediumSoftware EngineerFind the Row Watched by the Most Security Cameras
Each security camera covers a symmetric band of rows around its mounted position; find the integer row watched by the most cameras, breaking ties toward the smallest row number, using a sweep-line count instead of scanning every covered row.
Coding & AlgorithmsOnline Assessmentsweep-linesortingintervals - Capital OneMediumSoftware EngineerFind the Top-Left Submatrix Matching a Grid Pattern With Letter Variables
Locate a pattern grid inside an integer matrix, where each pattern cell is either an exact number or a letter that must stand for one consistent value, and return the top-left corner of the match with the lowest row and then the lowest column. It tests two-dimensional scanning, variable binding, and tie-breaking rules.
Coding & AlgorithmsOnline Assessment
C3 AI
Capital One