Company Name: Oracle

Job Role: Associate Software Engineer

Years of Experience Required: 0

Drive: On-campus

Preparation

Topics: OOPS, DBMS, CN, OS, DSA, Interview Experiences

Duration: 4 – 5 months

Source of Preparation:

• OOPS – Javatpoint,GeeksForGeeks
• DBMS – Javatpoint, GeeksForGeeks
• CN – Basic Knowledge is enough
• OS – OS (This covers almost all topics in OS, mostly enough for interviews)
• (Tip) Checkout Roadmaps given by LoveBabbar and Striver, Has a lot of useful content
• (Tip) Try to prepare notes for all these, you need to revise them again and again.
• DSA – LeetCode, GeeksforGeeks, InterviewBit
• Keep on practicing each and every day, Try to solve all sums in Strivers’s Sheet !
• Most asked Core questions – LinkedIn

[BONUS]:

• Check Striver’s SDE Sheet for Interview Preparation.
• Check the ultimate resume building guide for coding interviews.
• Blind 75 Leetcode

Interview Rounds

Round 1: MCQ Assessment

It had 4 sections:

1. Aptitude Test ( Common aptitude questions)
2. Coding Skills (Trees, Flowcharts, Predict O/P)
3. Computer Science Knowledge (OOPS, DBMS, OS, Networks)
4. Contextual Communication ( Grammar, Parts of Speech, etc.)

Round 2: Coding Test

Problem List:

Problem Statement: Given N inputs in the form of {C1, C2, D} (C1 – city1, C2 – city2, D – distance).D represents the distance between city1 and city2. Given Q queries in the form of {Cm, Cn}, find the shortest distance between Cm and Cn for all the ‘Q’ queries.

Input Format: 

N
N inputs Ci Cj Dij
Q
Q inputs Ci Cj

Examples:

Input Format: 
N = 7, 
1 2 4
2 3 1
3 6 9
1 4 3
4 5 1
2 4 9
3 4 2
Q = 3,
 1 4
 3 6
 1 6
Result: 
3 
3
Explanation: 
For 1 4, 
1 -> 4

For 3 6,
3 -> 6 gives 9, so check if there is a better way to reach 9 from 3
3 -> 4 -> 6 ( 2 + 1 = 3)
For 1 6,
1 -> 6 direct path isn’t there, so find the best of all possibilities to 6.
1 -> 4 -> 6 ( 3 + 1 = 4)

Problem Statement: Given an m * n grid of characters and a string s, find if the string s exists in the grid.

Input Format: 

M
N
M*N characters
String S

Examples:

Input Format: 
M = 5,
N = 3,
[["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]]
ABCCED
Result: True

Explanation:

Round 3: Face to Face Interview Round

Topics asked: Projects, OOPS, DBMS Queries, OS, Puzzles

Problem: Insert node in Doubly Linked List( all 3 types with code)

Round 4: Face to Face Interview Round

Topics asked: OOPS, DBMS(theory) , OS, Puzzles

Problems: 

1. Detection of loop in a linked list(with code and dry run)
2. Given a family tree where each person can have multiple children, you have to find all the grandchildren’s children.(with code)

Round 5: HR Round

Common questions like strengths, weaknesses, etc.

Verdict: Selected

Message to Aspiring Students:

-> Be prepared and be ready to face the interview at any time

-> Concentrate on DSA which is the key for success and reach new heights

-> Have a smile on your face and don’t get tensed.

-> Focus on your basics

-> Explain with an example so that the point gets clear.

-> Don’t stop learning.

All the best ! 

~ Ruthwik