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 2341–2370 of 2629 results
- TripStackMediumSoftware EngineerCompute minimum resources for overlapping intervals
This question evaluates understanding of interval overlap reasoning, resource-allocation and scheduling concepts, and proficiency with algorithmic complexity and appropriate data structure choices.
Coding & AlgorithmsTechnical Screen - TripadvisorMediumSoftware EngineerBuild blog UI with API data and likes
This question evaluates front-end JavaScript competencies including UI rendering, client-side state management, asynchronous REST API integration, loading and error handling, and resolving author identity relative to the current user.
Coding & AlgorithmsOnline Assessment - TruefoundryMediumSoftware EngineerQuery a Versioned Array
This problem tests your ability to design a data structure that supports efficient state snapshots and point queries, specifically focusing on space-time trade-offs.
Coding & AlgorithmsOnsiteData StructuresBinary SearchArrays - TruefoundryMediumSoftware EngineerVerify Ordering Under a Scrambled Alphabet
This problem tests string manipulation, hash map usage for indexing, and the ability to compare two strings based on custom character priority.
Coding & AlgorithmsOnsiteStringsSortingHash Map - TubiMediumSoftware EngineerExecute TTL Cache Operations with Fetch-on-Miss
Implement a deterministic TTL cache simulator with put, get, delete, size, and fetch-on-miss operations. Preserve expired records until deletion or replacement, model loader success and failure explicitly, and validate timestamped JSON-compatible inputs.
Coding & AlgorithmsTechnical Screen - TuringMediumSoftware EngineerCount permutations with exactly n inversions
This Coding & Algorithms question evaluates combinatorial counting and algorithmic skills related to permutations and inversion counts, emphasizing dynamic programming and modular arithmetic for large-result handling.
Coding & AlgorithmsTechnical Screen - TuroMediumSoftware EngineerCheck if a word exists in a grid
This question evaluates a candidate's skills in backtracking search, grid traversal, and managing state for constrained path-finding problems. Commonly asked to assess algorithmic problem-solving, recursion and memory-management (including in-place visited marking) within the Coding & Algorithms domain, it emphasizes practical application and understanding of time and space complexity trade-offs rather than purely theoretical concepts.
Coding & AlgorithmsTechnical Screen - TwitchMediumSoftware EngineerSolve four design-leaning coding problems
This multi-part question evaluates algorithmic problem-solving, data structure design and manipulation (such as LRU cache semantics), stateful simulation and scoring logic, chronological quota accounting for billing, and set/map operations for detecting overlaps.
Coding & AlgorithmsOnsite - Two SigmaMediumSoftware EngineerAutoscale a Server Fleet from Throughput Readings
This question evaluates algorithmic implementation skills and numeric reasoning, focusing on stateful simulation of autoscaling behavior and capacity arithmetic under streaming throughput readings.
Coding & AlgorithmsTechnical Screen - Two SigmaHardSoftware EngineerCompute maximum currency exchange rate
Compute maximum currency exchange rate evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - Two SigmaMediumSoftware EngineerImplement Price-Time Order Matching
Design and implement an in-memory limit order book matching engine supporting buy and sell orders with price-time priority (FIFO) and order cancellation.
Coding & AlgorithmsTechnical Screenheapdesignhash-table - Two SigmaMediumSoftware EngineerImplement a Hash Map with Separate Chaining and Resizing
This question evaluates understanding of hash table fundamentals, including hashing, separate chaining collision resolution, linked-list bucket management, dynamic resizing, and rehashing to maintain load factor and amortized performance.
Coding & AlgorithmsTechnical Screen - Two SigmaHardSoftware EngineerImplement an In-Memory Database
This question evaluates competence in implementing in-memory relational data structures, parsing tokenized database-like commands, and evaluating compound predicates with comparison operators.
Coding & AlgorithmsTechnical Screen - Two SigmaHardSoftware EngineerImplement binary encode/decode with frequency tree
This question evaluates understanding of frequency-based binary encoding and decoding, including deterministic tree construction, tie-breaking rules, and traversal, and tests knowledge of trees, priority queues, greedy algorithms, and bit-level string manipulation in the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - Two SigmaMediumSoftware EngineerMatch Limit Orders with Price-Time Priority
Implement a limit order matching engine adhering to price-time priority (FIFO), resting-order execution pricing, and partial fill mechanics.
Coding & AlgorithmsTechnical ScreenHeapData StructuresSimulation - Two SigmaMediumSoftware EngineerMaximize Capital by Completing at Most k Projects
This question evaluates algorithmic problem-solving and optimization skills within the Coding & Algorithms domain, focusing on selection under resource and operation constraints and reasoning about time and space complexity.
Coding & AlgorithmsTechnical Screen - Two SigmaMediumSoftware EngineerSolve capital selection and grid escape
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve capital selection and grid escape states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - 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 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 - 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
Tubi
Turo
Twitch
Two Sigma
Uber