practice a little every day, paws crossed ♡
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 6601–6630 of 9403 results
- OracleMediumSoftware EngineerMaximize 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 EngineerMaximize 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 EngineerMaximum 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 EngineerMaximum 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 EngineerMaximum 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 EngineerMerge 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 EngineerMinimize 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 EngineerMinimum 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 - OracleEasySite Reliability EngineerMitigate an Emergency During On-Call
This question assesses the candidate's ability to handle high-pressure production incidents by evaluating their structured approach to containment, risk assessment, and post-incident remediation.
Behavioral & LeadershipOnsiteIncident ManagementSREOn-call - OracleEasySite Reliability EngineerMonitor 100,000 GPU Hosts and Trigger Repair Workflows
This question tests the ability to design a distributed telemetry collection and automated incident remediation system for a large-scale hardware fleet.
System DesignOnsiteDistributed SystemsObservabilityAutomation - OracleMediumSoftware EngineerMove 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 EngineerObject-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 EngineerParse 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 EngineerPresent 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 EngineerPrioritize 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 EngineerProcess 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 EngineerProject 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 EngineerPropose 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 EngineerRank 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 EngineerRearrange 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 EngineerRemove 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 EngineerRepeatedly 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 EngineerReplace 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 EngineerResolve 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 EngineerResolve 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 EngineerRespond 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 - 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 - OracleMediumBackend EngineerReturn the K Most Frequent Values with a Larger-Value Tie-Break
This problem tests proficiency with hash maps for frequency counting and custom sorting logic using priority queues or sorting algorithms.
Coding & AlgorithmsOnsiteHash MapSortingPriority Queue - 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
Oracle