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 4201–4230 of 5874 results

  • OracleHardSoftware Engineer
    Implement Queue Operations Using Two Stacks

    Implement queue enqueue, dequeue, and peek operations using exactly two LIFO stacks. The challenge tests transfer invariants, output ordering, amortized O(1) reasoning, large operation sequences, empty input, and compliance with restrictions against queue-like shortcuts.

    Coding & AlgorithmsTechnical Screen
  • OracleEasySoftware Engineer
    Implement a Key-Value Cache with Fixed TTL, Renewal and a Live-Entry Count

    Implement an in-memory key-value cache whose entries expire a fixed time-to-live after their last write, with put, get, renew and a count of live entries, and write your own tests for it. It tests expiry boundary semantics, renewal rules, efficient cleanup of expired entries and test design.

    Software Engineering FundamentalsOnsite
  • OracleEasySoftware Engineer
    Implement a Paginated Medical-Record Filter Without Guessing an Ambiguous Rule

    This problem tests your ability to handle ambiguous business logic through requirement clarification and implement a robust, paginated filtering system for sensitive data.

    Software Engineering FundamentalsTechnical ScreenPaginationRequirementsData-Validation
  • OracleHardSoftware Engineer
    Implement in-memory data structures and booking API

    This problem tests your ability to design a thread-safe, in-memory booking system using efficient data structures to handle temporal queries and capacity management.

    Coding & AlgorithmsTechnical ScreenHash MapConcurrencyAPI Design
  • OracleMediumSoftware Engineer
    Largest Island After Converting at Most One Water Cell to Land

    Given a grid of land and water, convert at most one water cell to land and return the size of the largest island that can result. An onsite follow-up coding problem that tests connected-component sizing, joining neighboring islands without counting one twice, and efficiency on grids up to 500 by 500.

    Coding & AlgorithmsOnsite
  • OracleMediumSoftware Engineer
    Leadership and ownership: real examples of leading others and owning an outcome

    A behavioral interview question that asks for real examples of leading others toward an outcome and of taking ownership of a problem through to the end. It tests specific storytelling, a clear personal contribution, handling disagreement and setbacks, measurable results and honest reflection.

    Behavioral & LeadershipOnsite
  • OracleMediumSoftware Engineer
    Maximize Movie Ratings Without Skipping Two in a Row

    Find the maximum possible sum of a subsequence such that no two consecutive elements from the original array are omitted.

    Coding & AlgorithmsOnsitedynamic-programmingarraysgreedy
  • OracleMediumSoftware Engineer
    Maximize Profit with One Stock Transaction

    This problem tests the ability to find the optimal buy and sell points for a stock within a single transaction, focusing on an efficient O(n) single-pass approach.

    Coding & AlgorithmsOnsiteArraysGreedyDynamic Programming
  • OracleMediumSoftware Engineer
    Maximum of Fixed-Window Minimums

    Tests the ability to compute sliding-window minima in linear time using a monotonic deque and determine the maximum value among those minima.

    Coding & AlgorithmsTechnical Screensliding-windowmonotonic-queuedeque
  • OracleMediumSoftware Engineer
    Maximum stock trading profit with at most k buy-and-sell transactions

    Given daily stock prices and a transaction limit k, compute the maximum profit achievable with at most k buy-then-sell trades while holding at most one share at a time. It tests generalizing a fixed-count trading problem, handling a k larger than the available profitable trades, and tracking state efficiently.

    Coding & AlgorithmsOther
  • OracleMediumSoftware Engineer
    Maximum stock trading profit with at most two buy-and-sell transactions

    A stock trading optimization problem: given daily prices, find the maximum profit using at most two buy-then-sell transactions while holding at most one share at a time. It tests reasoning about splitting the price history into non-overlapping trades and handling falling, flat or steadily rising prices.

    Coding & AlgorithmsOther
  • OracleMediumSoftware Engineer
    Merge Accounts by Shared Identifiers

    This problem tests graph traversal techniques (BFS/DFS) and Disjoint Set Union (DSU) to group connected entities based on shared attributes.

    Coding & AlgorithmsOnsiteGraphDSUDFS
  • OracleMediumSoftware Engineer
    Minimize sum with halving operations

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Minimize sum with halving operations states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsOnsite
  • OracleMediumSoftware Engineer
    Minimum number of rooms needed to hold overlapping meetings

    A coding question that asks for the minimum number of rooms needed so that every meeting in an unsorted list of half-open time intervals can be held without overlap. It tests reasoning about overlapping intervals, the boundary rule for meetings that end and start at the same time, and an efficient solution for large inputs.

    Coding & AlgorithmsOnsite
  • OracleMediumSoftware Engineer
    Move Forward When Requirements Are Ambiguous

    This question assesses a candidate's ability to navigate project uncertainty by balancing proactive problem-solving with effective stakeholder communication.

    Behavioral & LeadershipTechnical ScreenBehavioralCommunicationProject Management
  • OracleMediumSoftware Engineer
    Object-oriented design of a fixed-capacity LRU cache with O(1) get and put

    An object-oriented design question that asks for a fixed-capacity least-recently-used cache whose get and put operations run in constant average time and evict the least recently used entry when the cache is full. It tests class decomposition, data structure choice, recency bookkeeping, edge cases and awareness of thread safety.

    Software Engineering FundamentalsOnsite
  • OracleMediumSoftware Engineer
    Parse logs and query by time

    This question evaluates competency in parsing and structuring log lines, interpreting timestamps and time zones, handling malformed input, designing insert/query APIs, reasoning about scalability and indexing, performing time/space complexity analysis, and planning basic tests.

    Data Manipulation (SQL/Python)Onsite
  • OracleMediumSoftware Engineer
    Present Your Proudest Project

    This question tests your ability to articulate the narrative arc of a technical project, focusing on your specific contributions, decision-making process, and the long-term impact of your work.

    Behavioral & LeadershipOnsiteBehavioralLeadershipCommunication
  • OracleMediumSoftware Engineer
    Prioritize Two Critical Tasks

    Tests an engineer's ability to evaluate, prioritize, and manage trade-offs when two high-impact, urgent tasks compete for the same engineering capacity, while proactively mitigating risks and communicating with stakeholders.

    Behavioral & LeadershipOnsitePrioritizationLeadershipStakeholder Management
  • OracleEasySoftware Engineer
    Process Tokens with Explicit Expiration Times

    This problem tests your ability to manage temporal data using efficient data structures, specifically focusing on handling expiration logic and range-based queries.

    Coding & AlgorithmsOnsiteHash MapHeapDesign
  • OracleMediumSoftware Engineer
    Project deep dive: full architecture diagram, design decisions and business impact

    A project deep-dive interview question that asks you to draw the complete architecture of your current project, defend its key design decisions against alternatives, and explain the business impact of your past work. It tests understanding of the whole system, clear ownership, trade-off reasoning and quantified results under probing.

    Behavioral & LeadershipOnsite
  • OracleMediumSoftware Engineer
    Propose a Design or Process Improvement

    This question tests your ability to identify a systemic engineering bottleneck, evaluate trade-offs objectively, and execute a data-backed technical improvement.

    Behavioral & LeadershipOnsiteBehavioralSystem DesignProcess Improvement
  • OracleMediumSoftware Engineer
    Rank Departments by Student Count

    Tests SQL proficiency in outer joins, aggregation with null handling, and deterministic multi-column sorting.

    Data Manipulation (SQL/Python)Onsitesqlleft-joingroup-by
  • OracleMediumSoftware Engineer
    Rearrange an Integer Array into Its Next Lexicographic Arrangement

    A coding problem that asks you to rearrange an integer array into the next lexicographically greater arrangement of its values, wrapping around to ascending order when the array is already the largest. It tests reasoning about lexicographic order, repeated values and complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • OracleMediumSoftware Engineer
    Remove Even-Positioned Nodes from a Linked List

    This problem tests your ability to manipulate singly linked list pointers in-place, specifically managing alternating node removals while maintaining correct connectivity.

    Coding & AlgorithmsOnsiteLinked ListPointersAlgorithms
  • OracleMediumSoftware Engineer
    Repeatedly Delete Runs of k Adjacent Equal Characters from a String

    Given a lowercase string and an integer k, repeatedly delete k adjacent equal characters, letting the remaining parts join and possibly form new runs, until no deletion is possible, then return what remains. It tests efficient simulation of cascading removals on strings of up to 100,000 characters.

    Coding & AlgorithmsTechnical Screen
  • OracleEasySoftware Engineer
    Replace a Range of Nodes in a Linked List with Another Linked List

    Given two singly linked lists and two indices i and j, replace nodes i through j of the first list with every node of the second list and return the new head. It tests careful pointer relinking, head and tail edge cases, and an empty replacement list.

    Coding & AlgorithmsOnsite
  • OracleMediumSoftware Engineer
    Resolve Conflict Within a Team

    This question tests your ability to navigate interpersonal and technical disagreements professionally while maintaining team productivity and morale.

    Behavioral & LeadershipOnsiteConflict ResolutionCommunicationCollaboration
  • OracleMediumSoftware Engineer
    Resolve a Customer Problem

    This question assesses a candidate's ability to navigate high-pressure customer incidents by balancing technical problem-solving with transparent stakeholder communication.

    Behavioral & LeadershipOnsiteBehavioralIncident ManagementCommunication
  • OracleEasySoftware Engineer
    Respond to a Material Scope Change Mid-Project

    This question assesses a candidate's ability to handle ambiguity and scope creep by demonstrating a structured, data-driven approach to project recalibration.

    Behavioral & LeadershipOnsiteBehavioralProject ManagementLeadership