Coding & Algorithms interview questions

Showing 2161–2190 of 3276 results

• Solve a Skyscraper puzzle efficientlyMedium

  This question evaluates understanding of constraint satisfaction and combinatorial search, testing competency in modeling Latin-square domains with visibility constraints, pruning and uniqueness verification, and algorithmic complexity analysis.

  OptiverQuantitative TraderCoding & AlgorithmsOnline Assessment
• Solve three mini-game algorithm tasksMedium

  Solve three mini-game algorithm tasks 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.

  OptiverSoftware EngineerCoding & AlgorithmsTechnical Screen
• Stone Pile Doubling Game: Can One Pile Be Emptied?Easy

  This question evaluates a candidate's algorithmic reasoning and discrete-mathematics skills, particularly understanding deterministic state transitions, invariants, and cycle detection in iterative processes.

  OptiverQuantitative ResearcherCoding & AlgorithmsTechnical Screen
• Thread-Safe Stock Inventory: Buy and Sell Without OversellingMedium

  This question evaluates understanding of concurrent programming, synchronization primitives, atomicity, and correctness of shared mutable state by requiring implementation of a thread-safe inventory that prevents overselling and preserves updates.

  OptiverSoftware EngineerCoding & AlgorithmsTechnical Screen
• Validate a Binary Tree Built from Directed EdgesMedium

  This question evaluates understanding of tree and graph fundamentals including parent-child constraints, duplicate-edge detection, cycle detection, node-degree limits, and in-order traversal semantics.

  OptiverSoftware EngineerCoding & AlgorithmsOnline Assessment
• Add One to an Integer Stored as Digits Without ArrayListMedium

  This problem tests array manipulation skills and the ability to handle carry-over logic in fixed-size numerical representations.

  OracleBackend EngineerCoding & AlgorithmsOnsite
• Approximate a Square Root Across Values Above and Below OneMedium

  This problem tests binary search on a continuous search space and the ability to handle numerical precision for numbers both greater than and less than one.

  OracleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check That a String of Three Bracket Types Is Properly NestedMedium

  Decide whether a string made of round, square and curly brackets is properly nested, meaning every closing bracket matches the most recently opened bracket of the same type and nothing is left open. Tests careful handling of nesting order, crossing pairs and unmatched brackets at either end.

  OracleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Closed IslandsMedium

  This problem tests your ability to navigate a 2D grid using graph traversal algorithms like DFS or BFS while identifying connected components that do not touch the grid boundaries.

  OracleData ScientistCoding & AlgorithmsTechnical Screen
• Count Interior Islands After FloodingMedium

  This question evaluates understanding of grid-based graph traversal and connected-component detection, focusing on flood-fill logic and the treatment of boundary-connected regions in a binary grid.

  OracleData ScientistCoding & AlgorithmsTechnical Screen
• Count Islands and Return the Largest Island SizeMedium

  Count four-connected islands and find the largest island using DFS or BFS, with correct visited-state handling and all-water behavior.

  OracleSoftware EngineerCoding & AlgorithmsOnsite
• Count anagram-based replacements per phraseMedium

  This question evaluates skills in string processing, anagram grouping, frequency mapping, and combinatorial counting to determine how many phrase variations arise from permissible replacements in the Coding & Algorithms domain.

  OracleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count closed islands in a gridEasy

  This problem tests your ability to navigate a 2D grid using graph traversal algorithms like DFS or BFS while handling specific boundary constraints to identify closed regions.

  OracleData ScientistCoding & AlgorithmsTechnical Screen
• Decide Whether a Parenthesis String With Star Wildcards Can Be BalancedMedium

  Decide whether a string of parentheses and stars can become a balanced parenthesis string when each star may independently act as an opening parenthesis, a closing parenthesis or an empty string. Tests reasoning over many possible replacements at once and edge cases with unmatched parentheses near either end.

  OracleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design structure for first unique login userEasy

  This question evaluates a candidate's ability to design an efficient online data structure that maintains a stream of login events and supports constant-time updates and queries for the earliest user with exactly one login.

  OracleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Detect whether a directed graph given as an edge list contains a cycleMedium

  A coding question that asks whether a directed graph, given as a node count and a list of edges, contains at least one directed cycle. It tests graph traversal on large inputs and careful handling of self-loops, duplicate edges, converging paths and disconnected components.

  OracleSoftware EngineerCoding & AlgorithmsOnsite
• Enumerate Right-and-Down Paths Through a Binary MatrixMedium

  This problem tests your ability to explore paths in a grid using depth-first search (DFS) with backtracking while maintaining lexicographical output constraints.

  OracleSoftware EngineerCoding & AlgorithmsOnsite
• Fewest Coins for an Amount with Unlimited or Single-Use CoinsMedium

  Return the fewest coins that add up exactly to an amount, first when every coin value can be reused without limit and then when each listed coin can be used at most once. An onsite coding problem that tests the difference between unlimited and single-use selection and the handling of amounts that cannot be formed.

  OracleSoftware EngineerCoding & AlgorithmsOnsite
• Find Each Island's Maximum HeightMedium

  This problem tests your ability to perform graph traversal (BFS/DFS) on a 2D grid while maintaining state across connected components.

  OracleSoftware EngineerCoding & AlgorithmsOnsite
• Find shortest subarray meeting target sumMedium

  Find shortest subarray meeting target sum 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.

  OracleSoftware EngineerCoding & AlgorithmsOnsite
• Find the Best Profit from One Stock TradeMedium

  Tests array traversal, greedy state tracking, and achieving optimal O(n) time and O(1) space complexity for trade optimization.

  OracleBackend EngineerCoding & AlgorithmsOnsite
• Find the Lexicographically Maximum SuffixMedium

  This problem tests string manipulation, greedy algorithm design, and efficiency. It requires an O(n) solution to avoid Time Limit Exceeded errors on long strings, as naive O(n^2) comparisons will fail.

  OracleSoftware EngineerCoding & AlgorithmsOnsite
• Find users with at least one valid sessionMedium

  This question evaluates the ability to parse and process event logs, pair signin/signout events per user, and handle unordered timestamps and per-user state with time-window constraints.

  OracleSoftware EngineerCoding & AlgorithmsOnsite
• Implement Queue Operations Using Two StacksHard

  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.

  OracleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement in-memory data structures and booking APIHard

  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.

  OracleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Largest Island After Converting at Most One Water Cell to LandMedium

  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.

  OracleSoftware EngineerCoding & AlgorithmsOnsite
• Maximize Movie Ratings Without Skipping Two in a RowMedium

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

  OracleSoftware EngineerCoding & AlgorithmsOnsite
• Maximize Profit with One Stock TransactionMedium

  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.

  OracleSoftware EngineerCoding & AlgorithmsOnsite
• Maximum of Fixed-Window MinimumsMedium

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

  OracleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximum stock trading profit with at most k buy-and-sell transactionsMedium

  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.

  OracleSoftware EngineerCoding & AlgorithmsOther