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 5431–5460 of 5874 results
- UberMediumSoftware EngineerAnswer Common Behavioral Questions
This question assesses the candidate's ability to navigate professional conflict and technical disagreements while maintaining constructive relationships and project momentum.
Behavioral & LeadershipOnsiteBehavioralConflict ResolutionLeadership - UberHardSoftware EngineerAnswer Repeated Shortest Increasing-Path Queries
Preprocess shortest strictly increasing grid paths for repeated target queries, with deterministic BFS ties, predecessor reconstruction, and memory trade-offs.
Coding & AlgorithmsOnsite - UberMediumSoftware EngineerAssign Meetings to the Minimum Number of Rooms
Assign meetings to the minimum number of rooms using deterministic room ID allocation, returning the room assigned to each meeting in original input order.
Coding & AlgorithmsOnsiteheapintervalssorting - UberMediumSoftware EngineerBehavioral: your most complex project, a conflict you resolved, and a failure
Three hiring-manager behavioral questions: describe your most complex project, a conflict you resolved, and a failure you owned. Answers are judged on STAR structure, personal ownership, concrete and measurable results, a fair account of other people's views, and lessons that were actually applied later.
Behavioral & LeadershipOnsite - UberMediumSoftware EngineerBracket substrings matching any pattern
This problem tests your ability to efficiently match and replace substrings based on a set of predefined patterns, prioritizing matches based on position and length.
Coding & AlgorithmsTechnical ScreenStringsGreedyPattern Matching - UberHardSoftware EngineerBuild Quadtree and Find Grid Words
This problem tests your ability to implement a spatial partitioning data structure (Quadtree) for a grid and perform recursive searches to locate words within that grid efficiently.
Coding & AlgorithmsOnsiteQuadtreeBacktrackingTrie - UberMediumSoftware EngineerBuild a Quadtree and Analyze a Graph
This question evaluates skills in spatial data structures and recursive tree construction (building a quadtree) as well as graph analysis using traversal and cycle/safety detection to identify nodes that necessarily reach terminal nodes.
Coding & AlgorithmsTechnical Screen - UberHardSoftware EngineerCheck feasibility of AI course schedule
This question evaluates competency in analyzing directed graphs and dependency resolution, focusing on cycle detection and the feasibility of ordering prerequisites for course completion.
Coding & AlgorithmsOnsite - UberHardSoftware EngineerCheck if each prefix forms 1..k permutation
This question evaluates algorithmic thinking and understanding of permutations and prefix invariants, measuring the ability to recognize when the first k elements of a permutation can form the set {1..k}.
Coding & AlgorithmsOnline Assessment - UberHardSoftware EngineerCompare Paxos and Raft
This question evaluates understanding of distributed consensus protocols, replicated logs, linearizability, fault tolerance, and operational concerns such as leader election, quorum semantics, log replication, membership changes, and failure recovery.
System DesignOnsite - UberMediumSoftware EngineerCompute final prices with next smaller discount
This question evaluates array-processing and algorithmic problem-solving skills, focusing on reasoning about subsequent elements to compute element-wise discounts under input constraints.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerCompute outer boundary of an N-ary tree
This question evaluates proficiency in tree data structures and algorithm design, focusing on traversal and boundary extraction in ordered N-ary trees while requiring time and space complexity analysis.
Coding & AlgorithmsTechnical Screen - UberMediumSoftware EngineerCompute sums and maximum path in a tree
This problem tests your ability to perform post-order tree traversals to calculate subtree metrics and solve optimization problems involving paths that can span across parent-child boundaries.
Coding & AlgorithmsOnline AssessmentTreesRecursionDFS - UberMediumSoftware EngineerCompute time for virus to infect grid
This question tests the ability to model state propagation in a 2D grid using a Breadth-First Search (BFS) approach to determine the minimum time required for a condition to cover all cells.
Coding & AlgorithmsTechnical ScreenBFSGraphGrid - UberHardSoftware EngineerCount Islands After Each Land Addition to an All-Water Grid
A grid coding problem where land cells are added one at a time to an initially all-water grid and you must report the number of islands after every addition. It tests incremental connectivity, efficient merging of islands as they join, and correct handling of repeated additions.
Coding & AlgorithmsOnsite - UberMediumSoftware EngineerCount Islands After Land Additions
This question tests the ability to manage connected components in a grid dynamically, specifically requiring an efficient approach to track changes after incremental land additions.
Coding & AlgorithmsOnsiteGraphsDSUData Structures - UberHardSoftware EngineerCount Islands of Connected Land Cells in a Binary Grid
A classic grid coding problem asking you to count the islands formed by horizontally or vertically connected land cells in a binary grid. It tests grid traversal, connected-component counting, and careful handling of grid boundaries and already visited cells.
Coding & AlgorithmsOnsite - UberHardSoftware EngineerCount Palindromic Ancestor Paths
This problem tests your ability to use bit manipulation and prefix properties on trees to solve path-related queries efficiently, specifically focusing on the property that a set of characters can form a palindrome if at most one character has an odd frequency.
Coding & AlgorithmsOnline AssessmentBit ManipulationTreesDFS - UberMediumSoftware EngineerCount Valid Infection Orders
This problem tests your ability to use combinatorial counting and dynamic programming to determine the number of valid sequences in which a population can be infected under specific adjacency constraints.
Coding & AlgorithmsOnsiteDynamic ProgrammingCombinatoricsAlgorithms - UberMediumSoftware EngineerCount paths with prime-ending jumps
This question evaluates a candidate's ability to design and implement dynamic programming for counting paths, combining combinatorial reasoning with modular arithmetic and handling step-size constraints tied to primes ending in digit 3.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerCount subarrays with at least k fruit pairs
This question evaluates algorithmic problem-solving focused on frequency-based counting and efficient enumeration of subarrays, testing competence in designing subquadratic solutions and selecting appropriate data representations within the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerCount subarrays with ≥k identical pairs
This question evaluates proficiency in array algorithms, frequency-based counting and combinatorial reasoning for identifying equal-element pairs within contiguous subarrays.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerDeep Equality of Two Records
This problem tests your ability to recursively compare two complex, nested data structures while handling different types like dictionaries, lists, and primitives.
Coding & AlgorithmsTechnical ScreenRecursionData StructuresHash Maps - UberMediumSoftware EngineerDefine and integrate room ranking factors
Define and integrate room ranking factors evaluates metric design, causal reasoning, experiment setup, diagnostics, SQL/statistical checks, and recommendations in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Analytics & ExperimentationOnsite - UberMediumSoftware EngineerDescribe a Trade-off Design Change
This question evaluates system design trade-off decision-making, technical leadership, and communication by probing how an individual balances competing goals and constraints when changing an architecture.
Behavioral & LeadershipOnsite - UberMediumSoftware EngineerDescribe your strongest project
This question evaluates a candidate's technical leadership, ownership, communication, and ability to describe design trade-offs, metrics, and problem-solving within a software engineering project.
Behavioral & LeadershipOnline Assessment - UberMediumSoftware EngineerDesign A URL Shortener
This question tests your ability to design a high-scale, distributed URL shortening service that handles billions of requests while ensuring low latency and data durability.
System DesignOnsiteDistributed SystemsCachingScalability - UberHardSoftware EngineerDesign Distributed Storage for Large Structured Data
Design distributed storage with versioned metadata, block replicas, layered caches, failure repair, locality-aware jobs, and resource-aware load balancing.
System DesignOnsite - UberHardSoftware EngineerDesign Food Delivery Cart
This question tests the ability to design a distributed, highly concurrent shopping cart service for a food delivery platform, focusing on transactional integrity, race conditions, and eventual consistency.
System DesignOnsiteConcurrencyDistributed SystemsCaching - UberMediumSoftware EngineerDesign MapReduce for schedule aggregation
Design MapReduce for schedule aggregation evaluates requirements, scale assumptions, API/data design, architecture, trade-offs, failure modes, and rollout in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
System DesignOnsite
Uber