oracle logo
Oracle· IC3 (Senior Member of Technical Staff - SMTS)

Oracle OCI IC3 (Senior Member of Technical Staff - SMTS) | Bangalore | July 2025 | Selected

Location
Bangalore
Posted
15 Jul 2025
432 reads

Summary

I successfully navigated multiple technical and behavioral rounds, including DSA, System Design, and Java-specific questions, ultimately receiving a selection for the Senior Member of Technical Staff (SMTS) role at Oracle OCI, Bangalore.

How it went

I saw a post by recruiter on LinkedIn and contacted him via InMail. The recruiter contacted within few days asking basic details. Then radio silence for 3 weeks and then got a call from scheduling team for scheduling interviews

Screening Round Taken by a Principle MTS. I was asked 1 DSA question: Q: https://leetcode.com/problems/divide-two-integers/description/ Solved fully


Got a call from recruiter within 2 days for scheduling LOOP rounds:

Technical Round 1 (Taken by SMTS):

Round started with basic Java QUestions:

  • Polymorphism in Java, how to acheive
  • Composition & Association
  • Aggregation
  • Aggregation vs Composition

Then I was asked a DSA question:

  • Longest Subarray with 0 Sum - question from GFG

Lastly, I was told to draw the HLD for an ECommerce website like Amazon. Expectations:

  • Functional Requirements
  • Non Functional Requirements
  • DB Schema
  • DB resilient design
  • Services
  • Diagram

Bartender Round:

Taken by someone from different team. I was asked multiple behavioural questions. The round went almost 45 mins

Tecnical Round 2 (Taken by Director of Engineering):

Few behavioural Questions.

2 coding questions:

  • Given a String s, build all possible subsequences, sort them and return as a List
  • Create a Thread safe data structure and write 2 producer and 1 consumer for it.

Tecnical Round 3 (Taken by a Principle MTS):

  • Questions from Resume
  • 1 DSA question: Q: Remove duplicate sequence from linked list. Ex: Input: 1->2->2->2->5->4->4, output: 1->5 Input: 1->1->2->2->2->5->4->4, output: 5

Questions asked (10)

  1. 01

    Divide Two Integers

    Data Structures & Algorithms

    The problem asks to divide two integers without using multiplication, division, or modulo operators.

    Open the problem
  2. 02

    Polymorphism in Java

    Other

    Explain polymorphism in Java and how to achieve it.

  3. 03

    Composition & Association in Java

    Other

    Explain Composition & Association in Java.

  4. 04

    Aggregation in Java

    Other

    Explain Aggregation in Java.

  5. 05

    Aggregation vs Composition

    Other

    Discuss the differences between Aggregation and Composition.

  6. 06

    Longest Subarray with 0 Sum

    Data Structures & Algorithms

    Find the length of the longest subarray with a sum of 0.

  7. 07

    High-Level Design for E-commerce Website (Amazon-like)

    System Design

    Design a High-Level Architecture for an E-commerce website similar to Amazon. Discuss functional requirements, non-functional requirements, database schema, database resilient design, services, and provide a diagram.

  8. 08

    Generate and Sort All Subsequences of a String

    Data Structures & Algorithms

    Given a string s, generate all possible subsequences, sort them lexicographically, and return them as a list.

  9. 09

    Thread-Safe Data Structure with Producer-Consumer

    Data Structures & Algorithms

    Design and implement a thread-safe data structure. Then, write code for two producer threads and one consumer thread that interact with this data structure.

  10. 10

    Remove Duplicate Sequences from Linked List

    Data Structures & Algorithms

    Given the head of a singly linked list, remove all nodes that have duplicate consecutive numbers, leaving only distinct numbers. For example, if the input is 1->2->2->2->5->4->4, the output should be 1->5. If the input is 1->1->2->2->2->5->4->4, the output should be 5.

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!