oracle logo
Oracle· SDE II

Oracle | IC3 | Seattle, WA | Dec 2019 [Offer]

Result
Offer
Location
seattle, wa
Experience
4 years
Posted
16 Dec 2019
320 reads

Summary

I applied for an IC3 position at Oracle in Seattle, WA, in October 2019. After a phone screen and a 5-round onsite interview in December 2019, I successfully received a verbal offer the very next day.

How it went

I initiated my job search by applying for an IC3 position at Oracle (OCI) in Seattle, WA, through LinkedIn in October 2019. Following my application, I received an invitation for a phone screen in November 2019, which involved behavioral questions and an algorithm challenge. Shortly after, I was invited to schedule my onsite interviews, which took place in December 2019.

The onsite interviews comprised five distinct rounds:

  • Round 1: This round began with behavioral questions, followed by a data structures and algorithms problem.
  • Round 2: This round focused purely on algorithmic challenges, presenting two distinct problems.
  • Round 3: This was a lunch interview, primarily consisting of behavioral questions.
  • Round 4: I faced more behavioral questions, alongside an object-oriented design challenge to design a Chess game.
  • Round 5: The final round continued with behavioral questions and extended the discussion on the Chess design problem from the previous round.
After completing all rounds, I was delighted to receive a verbal offer for the position the very next day.

Questions asked (5)

  1. 01

    Add Strings

    Data Structures & Algorithms · Medium

    Given two non-negative integers num1 and num2 represented as strings, return the sum of num1 and num2 as a string. You must not use any built-in BigInteger library or convert the inputs to integer directly.

    Open the problem
  2. 02

    Lowest Common Ancestor of a Binary Tree

    Data Structures & Algorithms · Medium

    Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia: "The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself)."

    Open the problem
  3. 03

    Merge Intervals

    Data Structures & Algorithms · Medium

    Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

    Open the problem
  4. 04

    Longest Valid Parentheses

    Data Structures & Algorithms · Hard

    Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.

    Open the problem
  5. 05

    Object-Oriented Design: Chess Game

    System Design

    Design an object-oriented system for a Chess game.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Oracle recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!