oracle logo
Oracle· SDE I

Oracle Oci | IC2 | Bangalore | March 2022 [Offer]

Result
Offer
Location
bangalore
Posted
26 Mar 2022
353 reads

Summary

I successfully navigated through five rigorous interview rounds for an IC2 position at Oracle OCI in Bangalore in March 2022, ultimately receiving an offer.

How it went

My interview process for the IC2 role at Oracle OCI consisted of five rounds. The first round was a screening test, and clearing it led to the subsequent four rounds. In the initial screening, I encountered problems such as 'Intersection of two arrays', 'Valid Parentheses', 'Merge K Sorted Linked Lists', and some general questions related to operating systems. The second round focused on algorithmic problems, specifically 'Edit Distance' and determining if a 'Binary Tree is a Mirror'. The third round challenged me with finding the 'K most occurring elements in an array'. For the fourth round, I had a Low-Level Design (LLD) problem where I was asked to 'Design an API Rate Limiter'. The final, fifth round was with the Hiring Manager, which involved discussing my previous projects, performing a High-Level Design (HLD) of one of them, and then writing a program to solve a 'Crossword Puzzle'. I received a message from the Hiring Manager confirming my selection for the role.

Questions asked (8)

  1. 01

    Intersection of Two Arrays

    Data Structures & Algorithms · Easy

    Given two integer arrays, return an array of their intersection. The result should contain unique elements.

  2. 02

    Valid Parentheses

    Data Structures & Algorithms · Easy

    Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

  3. 03

    Merge K Sorted Linked Lists

    Data Structures & Algorithms · Hard

    Merge k sorted linked lists into one sorted linked list.

  4. 04

    Edit Distance

    Data Structures & Algorithms · Hard

    Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.

  5. 05

    Symmetric Tree (Is Binary Tree Mirror)

    Data Structures & Algorithms · Easy

    Check whether a binary tree is a mirror of itself (i.e., symmetric around its center).

  6. 06

    Top K Frequent Elements

    Data Structures & Algorithms · Medium

    Given an integer array and an integer k, return the k most frequent elements.

  7. 07

    Design API Rate Limiter (LLD)

    System Design · Medium

    Design a system for API rate limiting, focusing on Low-Level Design (LLD).

  8. 08

    Crossword Puzzle Solver

    Data Structures & Algorithms · Hard

    Write a program to solve a crossword puzzle, given a grid and a list of words to place.

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!