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 2641–2670 of 2810 results
- UberMediumSoftware EngineerImplement Store Autocomplete
This problem tests proficiency with prefix-based data structures and efficient string retrieval, specifically requiring a design that optimizes for frequent search operations over a static list of store names.
Coding & AlgorithmsTechnical ScreenTrieString ManipulationData Structures - UberHardSoftware EngineerMaintain the First Value That Appears Exactly Once
Practice a Uber coding interview problem focused on maintain the first value that appears exactly once. The prompt emphasizes edge cases, clean implementation, and verifiable test behavior without revealing the solution.
Coding & AlgorithmsTechnical Screen - UberMediumSoftware EngineerMaximize Throughput and Count Trigger Components
This problem tests your ability to optimize resource allocation using a greedy strategy and to identify connected components in a grid-based graph using traversal techniques.
Coding & AlgorithmsTechnical ScreenGreedyGraphsBFS/DFS - UberMediumSoftware EngineerMinimum Rooms, Merged Busy Blocks and Conflict Handling for Meeting Intervals
A multi-part coding question built on the classic meeting-room scheduling problem: find the minimum number of rooms for a set of meetings, merge overlapping meetings into busy blocks, and detect and handle booking conflicts. It tests interval ordering, endpoint conventions, sweep reasoning and efficient lookups.
Software Engineering FundamentalsTechnical Screen - UberMediumSoftware EngineerPrint directory tree with indentation
This question evaluates proficiency with representing and traversing hierarchical directory trees and producing depth-based formatted output, testing concepts such as tree traversal, recursion or iterative depth tracking, and string formatting for indentation.
Coding & AlgorithmsTechnical Screen - UberMediumSoftware EngineerProduce a valid deployment order
This question evaluates proficiency in graph algorithms and dependency resolution, including concepts such as topological ordering, cycle detection, and complexity analysis, plus systems-level reasoning about service deployment dependencies.
Coding & AlgorithmsTechnical Screen - UberMediumSoftware EngineerReturn a Package Build Order
This question evaluates a candidate's skills in dependency resolution, graph traversal and cycle detection while reasoning about an externally discovered dependency subgraph and ordering constraints.
Coding & AlgorithmsTechnical Screen - UberMediumSoftware EngineerReturn the Earliest ID Seen Exactly Once
Maintain the earliest single-visit ID with counts and queue pruning, handling permanent duplicates, empty results, and strict versus amortized constant-time queries.
Coding & AlgorithmsTechnical Screen - UberHardSoftware EngineerSmallest Palindromic Number Strictly Greater Than n, Up to 18 Digits
Given a positive integer of up to 18 digits as a string, return the smallest palindromic number strictly greater than it, or the input itself when no such palindrome stays within 18 digits. Tests digit-level reasoning and edge cases such as palindromic inputs, carries and changes in digit count.
Coding & AlgorithmsTechnical Screen - UberMediumSoftware EngineerSolve Prime Jumps and Pipeline Scaling
This question evaluates algorithmic problem-solving skills in constrained path optimization and resource-allocation throughput maximization, including concepts such as graph modelling with prime-step constraints, dynamic programming, number-theoretic reasoning, and combinatorial optimization.
Coding & AlgorithmsTechnical Screen - UberHardSoftware EngineerSolve Wonderful Strings and Grid Queries
This problem tests your ability to optimize string transformations using bitmask dynamic programming and to perform efficient range-based queries on a grid using a 2D data structure or sweep-line approach.
Coding & AlgorithmsTechnical ScreenBitmaskDynamic ProgrammingOffline Queries - UberMediumSoftware EngineerSolve two interview coding problems
These two problems evaluate algorithmic problem-solving skills: the first focuses on spatial reasoning and grid-based distance computation relative to obstacles, while the second targets tree traversal and character-frequency reasoning for ancestor-path palindrome checks.
Coding & AlgorithmsTechnical Screen - UberHardSoftware EngineerSort a Matrix into Snake Order Using Adjacent Swaps
Construct any legal adjacent-swap sequence that sorts a numbered matrix into snake order, prove correctness, validate the output, and discuss reducing swap counts.
Coding & AlgorithmsTechnical Screen - UberEasySoftware EngineerSort a String of Clothing Sizes
This problem tests the ability to perform a custom sort on a constrained set of characters using an O(n) counting approach rather than a standard comparison-based O(n log n) sort.
Coding & AlgorithmsTechnical ScreenSortingCounting SortString Manipulation - UberMediumSoftware EngineerSort by squares and find k-th smallest
This question evaluates array manipulation, ordering by derived keys (squares/absolute values), order-statistics reasoning, and algorithmic complexity analysis within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - UberMediumSoftware EngineerTrack Customer Referral Revenue
This problem tests your ability to model a tree structure and maintain aggregated values across subtrees using recursion or iterative tree traversal.
Coding & AlgorithmsTechnical ScreenTreesRecursionDFS - UiPathMediumSoftware EngineerCompute longest distinct substring, case-insensitive
This question evaluates competency in string processing, character normalization for case-insensitivity, algorithmic complexity analysis, and handling large-scale or streaming inputs.
Coding & AlgorithmsTechnical Screen - UiPathMediumSoftware EngineerDescribe project scope and ownership
This question evaluates ownership and technical leadership, including end-to-end project execution, architectural and product decision-making, trade-off analysis, and the ability to quantify impact under constraints.
Behavioral & LeadershipTechnical Screen - UiPathHardSoftware EngineerExplain database design and consistency
This question evaluates proficiency in database design and consistency concepts, covering competencies such as data modeling, datastore selection, partitioning and indexing strategies, consistency semantics, operational trade-offs, validation and testing, and privacy/compliance considerations.
System DesignTechnical Screen - UpstartMediumSoftware EngineerCompute buffet revenue with capacity and waiting
This question evaluates event-driven simulation and state-management skills, including handling customer lifecycle, capacity constraints, FIFO queuing behavior, and revenue aggregation.
Coding & AlgorithmsTechnical Screen - UpstartMediumSoftware EngineerDecode an anagram sentence using vocabulary constraints
This question evaluates string manipulation, anagram detection, and constrained dictionary mapping skills, testing attention to character-level constraints and correct disambiguation among similar vocabulary entries.
Coding & AlgorithmsTechnical Screen - UpstartMediumSoftware EngineerFind max word letter span
This question evaluates proficiency in string processing, character mapping, and algorithmic analysis by requiring computation of per-word letter spans while accounting for case normalization, punctuation handling, ties, duplicates, and edge-case word forms.
Coding & AlgorithmsTechnical Screen - ValonMediumSoftware EngineerDesign an In-Memory Database
This question evaluates a candidate's skills in data modeling, in-memory data structures, index design, and query/filter semantics for a flexible schema-less record store.
Coding & AlgorithmsTechnical Screen - ValonHardSoftware EngineerImplement an In-Memory Query Engine
Design and implement an in-memory query engine capable of ingesting records and executing structured queries with comparison, membership, and logical operators.
Coding & AlgorithmsTechnical ScreenData StructuresDesignRecursion - ValonHardSoftware EngineerImplement an in-memory SQL-like table
This problem tests your ability to design a flexible, in-memory table structure that supports dynamic schema definition, data storage, and basic relational query operations.
Coding & AlgorithmsTechnical ScreenData StructuresAPI DesignAlgorithms - ValonMediumSoftware EngineerLoan Ledger: Fee-First Payments and Out-of-Order Event Processing
Implement loan accounting handlers in Python where fees increase the fee balance and payments pay down fees before principal, then build a ledger that accepts payment and fee events out of order. It tests keeping events ordered by accounting sequence, updating later balances without reprocessing the whole history, handling ties and overpayments, and analyzing per-call cost.
Software Engineering FundamentalsTechnical Screen - ValonMediumSoftware EngineerSubscription Ledger: Credits-First Charges With Backdated Events
Implement billing event handlers where credits pay down usage before the subscription fee, then build a ledger that accepts charge and credit events out of chronological order and recomputes only the balances that a backdated event actually invalidates.
Software Engineering FundamentalsTechnical Screendata-structuresdesignordering - VantaMediumSoftware EngineerDesign streaming test logger and queries
This question evaluates a candidate's ability to design streaming data structures and time-series algorithms to track state transitions and compute interval queries, covering competencies in online/event-processing algorithms, interval overlap aggregation, and algorithmic complexity analysis within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - VantaMediumSoftware EngineerDesign test-run logging and query functions
This question evaluates proficiency in time-series logging, event-driven state transitions, interval and sliding-window algorithms, and efficient data-structure design for streaming updates.
Coding & AlgorithmsTechnical Screen - VercelMediumSoftware EngineerCount Hits in the Past Five Minutes
Implement a five-minute hit counter with ordered timestamped operations, repeated hits, and an explicit 300-second expiration boundary.
Coding & AlgorithmsTechnical Screen
Uber
UiPath
Upstart
Vanta
Vercel