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 4231–4260 of 5874 results
- OracleMediumSoftware EngineerReturn a valid course completion order
This question evaluates understanding of graph algorithms and dependency resolution, specifically skills in cycle detection and producing valid orderings of tasks.
Coding & AlgorithmsOnsite - OracleMediumSoftware EngineerShortest Subarray Whose Distinct-Value Sum Reaches a Target
Find the length of the shortest contiguous subarray of positive integers whose sum reaches a target when each distinct value is counted only once. A coding-screen problem that tests reasoning about contiguous ranges, bookkeeping for repeated values, and correct handling of the case where no subarray qualifies.
Coding & AlgorithmsOnsite - OracleEasySoftware EngineerSimulate a Least Recently Used Cache
This problem tests your ability to maintain data access recency and perform cache evictions in O(1) time complexity using a combination of a hash map and a doubly linked list.
Coding & AlgorithmsOnsiteData StructuresHash MapLinked List - OracleMediumSoftware EngineerSimulate an LFU cache that evicts the least-used key, breaking ties by recency
Implement and simulate a least-frequently-used cache with fixed capacity that evicts the key with the lowest use count, breaking ties by least recent use. It tests exact eviction semantics, treating updates and reads as uses, and supporting every get and put in constant average time.
Coding & AlgorithmsOther - OracleMediumSoftware EngineerSolve Five Coding Problems
This set tests proficiency across five key algorithmic domains: graph theory, array manipulation, numerical properties, cache design, and tree traversal.
Coding & AlgorithmsOnsiteGraphsLRU CacheRecursion - OracleMediumSoftware EngineerSolve the Hardest Project Challenge
This question tests your ability to structure a high-stakes professional challenge using the STAR method, specifically focusing on how you navigate ambiguity, influence technical decisions, and reflect on trade-offs.
Behavioral & LeadershipOnsiteBehavioralLeadershipProject Management - OracleMediumSoftware EngineerSolve three DSA problems: trie, window, intervals
This multi-part question evaluates proficiency with core data structures and algorithms — specifically trie-based string indexing and autocomplete design, sliding-window/prefix-sum optimization for maximizing a one-shot decrypted range, and interval merging — within the Coding & Algorithms domain, emphasizing practical implementation, complexity analysis and edge-case handling. It is commonly asked in technical interviews to assess the ability to design efficient data structures and linear-time algorithms, reason about time/space trade-offs and ordering constraints, and demonstrate both conceptual understanding and practical application through clear complexity analysis.
Coding & AlgorithmsOnsite - OracleMediumSoftware EngineerSum the Binary Numbers Spelled by Root-to-Leaf Paths in a 0/1 Tree
Given a binary tree of 0 and 1 bits in level-order form, return the sum of the binary numbers spelled by every root-to-leaf path, reading the root as the most significant bit. The problem tests tree traversal, carrying an accumulated value down each path, and parsing a level-order serialization correctly.
Coding & AlgorithmsTechnical Screen - OracleMediumSoftware EngineerTake Ownership Through Ambiguity
This question assesses a candidate's ability to navigate unstructured environments, prioritize tasks under uncertainty, and drive consensus among cross-functional stakeholders.
Behavioral & LeadershipOnsiteBehavioralLeadershipProject Management - OracleMediumSoftware EngineerTimestamped key-value store: return each key's value as of a query time
A coding question that processes set and get operations on a key-value store where each write carries a timestamp and each read asks for a key's value as of a given time. It tests per-key version history, finding the latest write at or before a query time, and handling many interleaved operations efficiently.
Coding & AlgorithmsOnsite - OscarMediumSoftware EngineerDesign Telehealth Consultation Queue
This question evaluates system design competency (Category: System Design), emphasizing distributed systems, queueing and matching logic, data modeling, API design, concurrency control, and regulatory compliance for constrained resource allocation.
System DesignOnsite - OscarEasySoftware EngineerDesign a Stateful Outreach Campaign Engine
This problem tests the ability to design a resilient, stateful task scheduler capable of handling asynchronous external triggers (responses) and idempotent state transitions.
System DesignTechnical ScreenDistributed SystemsState MachinesScheduling - OscarEasySoftware EngineerFind Clients Outside Provider Coverage
This problem tests spatial data processing and efficient set operations to identify gaps in service coverage between clients and providers based on distance and specialty requirements.
Coding & AlgorithmsTechnical ScreenAlgorithmsSpatialSet Operations - OscarMediumSoftware EngineerSolve Morse and Network Access Tasks
This question evaluates string encoding/decoding and combinatorial parsing skills (Morse code conversion and ambiguous decoding) alongside spatial search and filtering competencies for proximity-based access checks, testing algorithmic reasoning, pattern recognition, backtracking possibilities, distance computation, and data-structure use.
Coding & AlgorithmsOnsite - OtherMediumSoftware Engineer4.1 Design a Live Streaming Platform
This question evaluates a candidate's competency in large-scale system design, encompassing distributed systems, networking, storage, real-time processing, and scalability considerations specific to live video streaming.
System DesignOnsite - OtherMediumSoftware Engineer4.2 Design a Collaborative Document Editor
This question evaluates skills in designing real-time collaborative systems, including distributed-systems reasoning, conflict-resolution algorithms, real-time synchronization, presence and offline synchronization, and storage/versioning architecture.
System DesignOnsite - OtherMediumSoftware EngineerBatch Concurrent Logs into Five-Second Windows
Batch concurrent logs into half-open five-second processing-time windows with atomic rotation, a single ordered emitter, late-timer handling, and explicit shutdown and sink-failure policies.
Software Engineering FundamentalsOnsite - OtherMediumSoftware EngineerBuild a Queue Worker with Backoff and a Dead-Letter Queue
Design queue-worker retries with exponential backoff, durable delayed delivery, attempt limits, idempotent effects, and dead-letter replay, including AI-code validation.
Software Engineering FundamentalsOnsite - OtherEasySoftware EngineerClean up all Docker resources
This question evaluates proficiency in Docker resource management, covering containers, images, and volumes and the ability to perform a complete environment cleanup.
Software Engineering FundamentalsOnline Assessment - OtherMediumSoftware EngineerCompute total after discounting most expensive item
This question evaluates array manipulation and numeric computation skills—specifically identifying the maximum element, applying a percentage discount, and correctly handling fractional results and flooring—within the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - OtherEasySoftware EngineerCount Failing, Passing and Distinction Scores from Percentage Thresholds
Given an array of student exam scores as percentages, count how many students failed with under 50, passed with 50 to 80 inclusive, or passed with distinction above 80, and return the three counts in order. It tests careful handling of inclusive and exclusive boundaries and empty input.
Coding & AlgorithmsOnline Assessment - OtherMediumSoftware EngineerCount Grid Paths Without Three Consecutive Moves
Count monotone grid paths that use exact numbers of right and up moves without ever taking three identical moves in a row. Address empty and one-direction paths, return an exact count, and explain how the limits affect time and space costs.
Coding & AlgorithmsOnline Assessment - OtherMediumSoftware EngineerDesign a Task Scheduler
Design a durable task scheduler with due-time indexing, atomic claims, worker leases, retry states, recurring occurrences, and clear duplicate-delivery semantics.
System DesignOnsite - OtherMediumSoftware EngineerExplain How You Use and Validate AI at Work
Explain practical AI use at work through a concrete task, bounded prompts, independent validation, a corrected failure, and accountable engineering decisions.
Behavioral & LeadershipOnsite - OtherMediumSoftware EngineerExplain RF/analog IC interview fundamentals
This interview question evaluates engineering fundamentals, trade-offs, examples, pitfalls, and operational implications in a realistic interview setting. A strong answer for Explain RF/analog IC interview fundamentals states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Software Engineering FundamentalsOnsite - OtherEasySoftware EngineerFewest Days to Read a Book When Chapters Cannot Be Split Across Days
Given the reading time available on each day and the time each chapter of a book takes, find the fewest days needed to read every chapter in order when a chapter can never be split across days, or report that the book cannot be finished. It tests simulation with per-day capacity, ordering constraints, and impossible cases.
Coding & AlgorithmsOnline Assessment - OtherMediumSoftware EngineerFilter Logs by an Ordered Severity Threshold
Filter structured logs by an ordered minimum severity, preserving threshold-and-higher records while handling empty and unknown levels under an explicit contract.
Coding & AlgorithmsOnsite - OtherHardSoftware EngineerImplement a multi-button click detector
This question evaluates competency in real-time event stream processing, per-button state management, and timing-based classification of input events such as distinguishing single versus long presses.
Coding & AlgorithmsTechnical Screen - OtherEasySoftware EngineerLowest Common Ancestor in an Explicit Binary Tree
Find the lowest common ancestor in a binary tree using explicit child arrays, including identical targets, ancestor targets, and deep trees.
Coding & AlgorithmsOnline Assessment - OtherMediumSoftware EngineerReturn the k-th row of Pascal-like triangle
This question evaluates combinatorics, array manipulation, and space-efficient algorithm design by requiring computation of a specific row of Pascal’s triangle without constructing the full triangle.
Coding & AlgorithmsOnline Assessment
Oracle