Oracle

Oracle Software Engineer Onsite Coding Questions

82+ questions from real Oracle Software Engineer Onsite Coding rounds, reported by candidates who interviewed there.

82
Questions
8
Topic Areas
10+
Sources

What does the Oracle Onsite Coding round test?

The Oracle onsite coding round is the core technical evaluation. Software Engineer candidates typically see 2-3 algorithm and data structure problems. Problems range from medium to hard difficulty, and interviewers evaluate both correctness and code quality.

Top Topics in This Round

Oracle Software Engineer Onsite Coding Questions

Round 1: 1 26# (2) 25# can be decoded as azzy Round 2: 1944, a little more difficult, find the number of people each person can see on their left and right sides Round 3: Bar raiser, regular bq Round

I had recently interviewed with Oracle for the position of IC4 at Oracle Health. - **Screening Round (30th Oct)** 1. What is OOPs? 2. Why is string immutable? 3. Serialization / Transient 4. Synchroni

Status : 2023 grad, Tier-1 college Position : OMCS / Technical Analyst / Programmer Analyst Location : Bangalore/Hyderabad Online coding assessment: This round consists of one DP question, very similar to minimum path...

#146 LRU Cache

Hash Table

LeetCode #146: LRU Cache. Difficulty: Medium. Topics: Hash Table, Linked List, Design, Doubly-Linked List. Asked at Oracle in the last 6 months.

LeetCode #20: Valid Parentheses. Difficulty: Easy. Topics: String, Stack. Asked at Oracle in the last 6 months.

LeetCode #347: Top K Frequent Elements. Difficulty: Medium. Topics: Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect. Asked at Oracle in the last 6 months.

#1 Two Sum

Hash Table

LeetCode #1: Two Sum. Difficulty: Easy. Topics: Array, Hash Table. Asked at Oracle in the last 6 months.

LeetCode #3: Longest Substring Without Repeating Characters. Difficulty: Medium. Topics: Hash Table, String, Sliding Window. Asked at Oracle in the last 6 months.

LeetCode #200: Number of Islands. Difficulty: Medium. Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix. Asked at Oracle in the last 6 months.

LeetCode #253: Meeting Rooms II. Difficulty: Medium. Topics: Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum. Asked at Oracle in the last 6 months.

LeetCode #11: Container With Most Water. Difficulty: Medium. Topics: Array, Two Pointers, Greedy. Asked at Oracle in the last 6 months.

LeetCode #735: Asteroid Collision. Difficulty: Medium. Topics: Array, Stack, Simulation. Asked at Oracle in the last 6 months.

LeetCode #155: Min Stack. Difficulty: Medium. Topics: Stack, Design. Asked at Oracle in the last 6 months.

LeetCode #845: Longest Mountain in Array. Difficulty: Medium. Topics: Array, Two Pointers, Dynamic Programming, Enumeration. Asked at Oracle in the last 6 months.

LeetCode #208: Implement Trie (Prefix Tree). Difficulty: Medium. Topics: Hash Table, String, Design, Trie. Asked at Oracle in the last 6 months.

LeetCode #23: Merge k Sorted Lists. Difficulty: Hard. Topics: Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort. Asked at Oracle in the last 6 months.

LeetCode #239: Sliding Window Maximum. Difficulty: Hard. Topics: Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue. Asked at Oracle in the last 6 months.

LeetCode #1209: Remove All Adjacent Duplicates in String II. Difficulty: Medium. Topics: String, Stack. Asked at Oracle in the last 6 months.

LeetCode #127: Word Ladder. Difficulty: Hard. Topics: Hash Table, String, Breadth-First Search. Asked at Oracle in the last 6 months.

LeetCode #543: Diameter of Binary Tree. Difficulty: Easy. Topics: Tree, Depth-First Search, Binary Tree. Asked at Oracle in the last 6 months.

See All 82 Questions from This Round

Full question text, answer context, and frequency data for subscribers.

Get Access