oracle logo
Oracle· sde 2

oracle | OCI | IC2 | Bangalore | Jan 2022 [offer]

Result
Offer
Location
bangalore, india
Experience
2 years
Posted
25 Jan 2022
371 reads

Summary

I successfully received an offer for an SDE 2 position at Oracle OCI in Bangalore after completing 6 intensive interview rounds, covering data structures, algorithms, system design, and behavioral aspects.

How it went

I interviewed for an SDE 2 position at Oracle OCI in Bangalore, with a total of 6 rounds. The process started with a phone screen, followed by two dedicated Data Structures and Algorithms rounds. Next, I faced a System Design round and a Bar Raiser (Bar Tender) round, culminating in a discussion with the Hiring Manager. Each round typically included general introductions and behavioral questions centered on OCI's core values, in addition to specific technical challenges. I was pleased to receive an offer after successfully navigating all the rounds.

Questions asked (8)

  1. 01

    Remove Duplicates from Sorted List

    Data Structures & Algorithms · Easy

    Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well.

    Open the problem
  2. 02

    Maximum Subarray (with Indices)

    Data Structures & Algorithms · Medium

    Find the contiguous subarray within an array (containing at least one number) which has the largest sum. Additionally, I was asked to return the start and end indices of this subarray.

    Open the problem
  3. 03

    Spiral Matrix

    Data Structures & Algorithms · Medium

    Given an m x n matrix, return all elements of the matrix in spiral order.

    Open the problem
  4. 04

    Path Sum II

    Data Structures & Algorithms · Medium

    Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where the sum of the node values in the path equals targetSum. Each path should be returned as a list of the node's values, not node references.

    Open the problem
  5. 05

    Top K Frequent Elements

    Data Structures & Algorithms · Medium

    Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.

    Open the problem
  6. 06

    Design TinyURL

    System Design · Hard

    Design a system that receives a long URL and returns a short URL. When the short URL is accessed, it should redirect to the original long URL. Consider aspects like scalability, availability, data storage, and collision handling.

  7. 07

    Simplify Path

    Data Structures & Algorithms · Medium

    Given a string path, which is an absolute path (starting with a slash '/') to a file or directory in a Unix-style file system, convert it to the simplified canonical path.

    Open the problem
  8. 08

    Word Search (Horizontal, Vertical, Diagonal)

    Data Structures & Algorithms · Medium

    Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally, vertically, or diagonally neighboring. Unlike the standard problem, the word must follow a single direction (horizontal, vertical, or diagonal) for its entire length, not a combination of them.

    Open the problem

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!