oracle | OCI | IC2 | Bangalore | Jan 2022 [offer]
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.
Full Experience
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.
Interview Questions (8)
Remove Duplicates from Sorted List
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.
Maximum Subarray (with Indices)
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.
Spiral Matrix
Given an m x n matrix, return all elements of the matrix in spiral order.
Path Sum II
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.
Top K Frequent Elements
Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.
Design TinyURL
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.
Simplify Path
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.
Word Search (Horizontal, Vertical, Diagonal)
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.