15 practice questions for Oracle technical interviews
codingEasyVerified
Top Recurring Substring
Category: Graph coding problemA search analytics service needs to find which fixed-length pattern occurs most often in a block of text. Given a lowercase string s and a positive...Input: Graph (nodes and edges) Output: Computed result
codingEasyVerified
Active Sprint Filter
Category: Graph coding problemA project tracking system logs team activity throughout the workday. Each log entry has the format "teamId action timestamp", where action is...Input: Graph (nodes and edges) Output: Printed output
codingMediumVerified
Evens Before Odds
Category: Array coding problemYou are given an integer array nums. Rearrange nums so that all even numbers appear before all odd numbers. The relative order of even or odd...Input: Array Output: Integer
codingEasyVerified
Top Frequency Substring
Category: Graph coding problemGiven a string text containing only lowercase English letters and a positive integer k, find the substring of length k that appears most...Input: Graph (nodes and edges) Output: Computed result
codingEasyVerified
Card Straight Check
Category: String coding problemYou are dealt five playing cards. Determine whether they can form a straight, which is a sequence of five consecutive values regardless of suit. Card...Input: String Output: Computed result
codingMediumVerified
Cyclic Digit Primality
Category: Algorithm coding problemA number is called a cyclic prime if every rotation of its decimal digits produces a prime number. A rotation moves the leftmost digit to the...Input: Integer(s) Output: Computed result
codingMediumVerified
Tower Game Optimizer
Category: Array coding problemA tower has n floors numbered from 0 to n - 1. Each floor has an energy cost to traverse and a reward value. You start a ball at one chosen...Input: Array Output: Computed result
codingMediumVerified
Social Network Friend Suggester
Category: Array coding problemBuild a friend recommendation system for a social network. Given n users (indexed 0 to n - 1) and a list of existing friendships (undirected...Input: Array Output: Array
codingMediumVerified
Item Price Tracker
Category: Algorithm coding problemDesign a class that tracks the price history of a single product. Price records are keyed by timestamp and can be updated at any time. The tracker...Input: Given input Output: Computed result
codingEasyVerified
[CodeSignal] Filtered Palindrome Check
Category: Array coding problemGiven two character arrays skipChars and inputChars, determine whether inputChars forms a palindrome after removing all characters that appear...Input: Array Output: Printed output
codingEasyVerified
Eliminate Adjacent Repeats
Category: String coding problemYou are given a string s of lowercase English letters. In one operation, you may change any single character to any other lowercase letter. Find...Input: String Output: Integer
codingEasyVerified
[CodeSignal] Adjacent Character Removal
Category: Algorithm coding problemYou have a word of length L made up only of lowercase English letters. A character at position i is called a conflict if it equals the...Input: Number(s) Output: Integer
codingMediumVerified
Top Values After Operations
Category: Array coding problemYou are given an array of non-negative integers nums and two integers k and m. Perform exactly k operations on nums. In each operation: 1....Input: Array Output: Computed result
codingEasyVerified
Kth Largest Net Borrower
Category: String coding problemYou are analyzing a peer-to-peer lending platform. Each loan is recorded as a triplet [borrower, lender, amount] where borrower and lender are...Input: List Output: Computed result
codingHardVerified
Expression Simplifier
Category: String coding problemGiven an algebraic expression string containing single lowercase-letter variables, the operators + and -, and parentheses ( and ), simplify...Input: String Output: Computed result
No AI generated questions yet for Oracle.
Start practicing Oracle questions
Sign up for free to access walkthroughs, AI-generated questions, and more.