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 481–510 of 520 results

  • UberMediumSoftware Engineer
    Last Truck to Leave a One-Dimensional Lane

    Determine the time and ID of the last truck to exit a one-dimensional lane where trucks travel at constant speed and reverse directions upon colliding.

    Coding & AlgorithmsOnline AssessmentArraysSortingBrainteaser
  • UberHardSoftware Engineer
    Maximize Minimum Scaled Value

    This problem tests your ability to use binary search on the answer space to solve a constrained resource allocation problem effectively.

    Coding & AlgorithmsOnline AssessmentBinary SearchGreedyOptimization
  • UberHardSoftware Engineer
    Maximum Score with Prime Jumps

    This problem tests dynamic programming and number theory, specifically the ability to combine linear path traversal with jump-based transitions constrained by prime number properties.

    Coding & AlgorithmsOnline AssessmentDynamic ProgrammingPrime NumbersGraph Traversal
  • UberMediumSoftware Engineer
    Minimum Delivery Cost Between Cities

    This problem tests your ability to optimize pathfinding costs in a graph where edge weights are determined by a combination of absolute differences and conditional local minimums.

    Coding & AlgorithmsOnline AssessmentGraphsShortest PathGreedy
  • UberMediumSoftware Engineer
    Parse and evaluate nested expressions with validation

    This question evaluates a developer's ability to design and implement a robust parser and evaluator for a parenthesized expression language, testing parsing, lexical scoping and variable binding, operator semantics, error detection, and safe integer arithmetic.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Simulate fixed-shape tiling on a grid

    This question evaluates a candidate's ability to implement grid-based simulation and pattern-matching algorithms, including handling fixed-shape placements, internal holes, bounds checking, collision detection, and explicit scanning/tie-breaking rules.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Solve 12 coding interview problems

    This multi-problem set evaluates broad algorithmic problem-solving skills, including bitwise reasoning, sliding-window and frequency analysis, stack/monotonic patterns, graph/DP reasoning with constrained jumps, and tree-path parity techniques.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Solve Balanced Permutations and Tree Reversals

    This two-part prompt evaluates array and permutation reasoning for detecting contiguous value ranges and directed graph/tree reasoning for minimizing edge reversals when choosing a root, testing competencies in index and interval management, graph traversal and orientation, and algorithmic counting.

    Coding & AlgorithmsOnline Assessment
  • UberHardSoftware Engineer
    Solve Knight and Reversal Problems

    This question evaluates graph modeling, state-space exploration, and shortest-path/reachability reasoning for nonstandard movement rules and constrained state transformations.

    Coding & AlgorithmsOnline Assessment
  • UberHardSoftware Engineer
    Solve 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 Engineer
    Solve 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 Engineer
    Compute 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 Engineer
    Count 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 Engineer
    Find 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 Engineer
    Find 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 Engineer
    Implement 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 Engineer
    Remove 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 Engineer
    Remove 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 Engineer
    Report 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 Engineer
    Scale 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 Engineer
    Scale 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 Engineer
    Solve 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 Engineer
    Solve 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 Engineer
    Sum 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 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
    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
  • 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 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
    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