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 391–420 of 427 results
- UberHardSoftware EngineerSolve Two OA Algorithm Problems
This problem tests your ability to optimize resource allocation using a greedy approach with a priority queue and to determine graph reachability within a constrained network.
Coding & AlgorithmsOnline AssessmentGreedyGraphsBFS - UberHardSoftware EngineerSolve jump maximization and palindromic path queries
This problem tests dynamic programming with array constraints and tree-based traversal combined with bitwise parity checks for palindromic properties.
Coding & AlgorithmsOnline AssessmentDynamic ProgrammingSliding WindowTrees - UpstartEasySoftware EngineerCompute a Point Set's Bounding Rectangle
This problem tests the ability to find the extrema of a coordinate set in a single linear pass to define an axis-aligned bounding box.
Coding & AlgorithmsOnline AssessmentArraysGeometryAlgorithms - UpstartMediumSoftware EngineerCount Words in Lexicographic Order
This problem tests your ability to efficiently process a collection of strings, count their occurrences using a hash map, and output them in a sorted format.
Coding & AlgorithmsOnline AssessmentHash MapSortingStrings - UpstartMediumSoftware EngineerFind Maximum Eastbound City Visits and Parse CSV
Tests string parsing for CSV records with quoted fields and escaped delimiters, followed by finding the longest valid subsequence of eastbound city visits with lexicographical tie-breaking.
Coding & AlgorithmsOnline AssessmentDynamic ProgrammingString ParsingAlgorithms - UpstartMediumSoftware EngineerFind the Minimum Absolute Difference
This problem tests your ability to efficiently find the minimum absolute difference between any two elements in an array, requiring an understanding of sorting and linear scans.
Coding & AlgorithmsOnline AssessmentSortingArraysAlgorithms - UpstartMediumSoftware EngineerImplement Byte Formatting and Cafeteria Billing
This problem tests your ability to implement custom string formatting logic for file sizes and a stateful simulation of a billing system with capacity limits.
Coding & AlgorithmsOnline AssessmentStringsSimulationHashing - UpstartEasySoftware EngineerRemove Duplicate Integers While Preserving Order
This problem tests your ability to filter elements from an array while maintaining the original sequence and ensuring optimal time complexity using auxiliary data structures.
Coding & AlgorithmsOnline AssessmentArraysHash TableData Structures - UpstartMediumSoftware EngineerRemove Duplicates While Preserving First-Appearance Order
Return each array value once in its original first-appearance order, using membership tracking without sorting the result.
Coding & AlgorithmsOnline Assessment - UpstartEasySoftware EngineerReport Where a Value Appears
Check whether a target value appears at an even index, an odd index, the first half, and the second half of an even-length list in a single scan.
Coding & AlgorithmsOnline AssessmentArrayFundamentalsEarly Termination - UpstartEasySoftware EngineerScale Ingredient Quantities
This problem tests string parsing and manipulation, specifically isolating numeric prefixes from measurement units and descriptive text while maintaining the relative structure of ingredient lists.
Coding & AlgorithmsOnline AssessmentStringsParsingData Manipulation - UpstartMediumSoftware EngineerScale Recipe Quantities Without Changing Product Descriptions
Multiply only the leading quantity in each ingredient line, preserving recipe order, product wording, and numbers inside descriptions.
Coding & AlgorithmsOnline Assessment - UpstartMediumSoftware EngineerSolve Reported OA Coding Problems
This prompt evaluates algorithmic problem-solving skills across grid-based ordering constraints, array pair-sum identification, and minimum-difference computation, testing knowledge of data structures, time/space complexity, and correctness conditions.
Coding & AlgorithmsOnline Assessment - UpstartMediumSoftware EngineerSolve remembered OA coding tasks
This set of problems evaluates skills in data aggregation and ordering (identifying top averages), computational geometry and extrema calculation (axis-aligned bounding rectangle), and grid constraint validation and consistency checking (partially filled 9x9 number board).
Coding & AlgorithmsOnline Assessment - UpstartMediumSoftware EngineerSum Multiples of Three, Five, or Seven
Calculate the sum of all unique positive integers strictly less than a given limit that are divisible by 3, 5, or 7. The problem requires using the Principle of Inclusion-Exclusion to achieve an O(1) time complexity capable of handling inputs up to 10^18.
Coding & AlgorithmsOnline Assessmentmathinclusion-exclusionarithmetic-series - 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 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 - 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 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 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 - Walmart LabsMediumSoftware EngineerMaximum Sum of Non-Adjacent Values in a Row
A coding problem that asks for the largest total obtainable from a row of non-negative values when no two chosen positions may be adjacent. It tests reasoning about take-or-skip choices, edge cases such as empty and single-element rows, and a solution fast enough for rows of up to 100,000 values.
Coding & AlgorithmsOnline Assessment
Uber
Upstart
Virtu Financial
Visa
Walmart Labs