Oracle interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Oracle
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 Months
Topics: DSA, OOPS, COMPUTER NETWORK, DBMS, OPERATING SYSTEM, PUZZLES, WEB DEVELOPMENT(RUBY ON RAILS, JAVASCRIPT, NODEJS)
Tip
Tip

Tip 1: Practice at least 300 Leetcode's most frequently asked Questions on every topic including array, LinkedList, stack, Tree, and dynamic programming.
Tip 2: In every screening test there is atleast one dynamic programming question will be there, so do Atleast one question daily on dynamic programming.
Tip 3: Be consistent for 4-6 months. When you feel your coding is improved do Atleast 2-3 good projects using Latest tech stack (Nodejs/angular/react/Django)
Tip 4: Start reading computer science fundamental subjects like (Computer Network, DBMS, and Operating systems). Many Product based companies like oracle, cisco, Microsoft, and Google asked these subjects in interviews. 
Tip 5: Prepare oops concepts, and puzzles from geeks for geeks.
Tip 7: When you're shortlisted for a particular company do read the interview experience for that particular company before interview.

Application process
Where: Campus
Eligibility: If you're in college then mostly company asked for more than 7 CGPA.
Resume Tip
Resume tip

Tip 1: Write 2-3 good projects in your resume (Write those in which you're good to explain things)
Tip 2: Don't write any fake internship experience, write CGPA in bold and write your achievements like any hackathon winner, class topper, Jee rank, etc.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 Minutes
Interview date3 Sep 2020
Coding problem1

Round 1: Timing is from 11:30-1:00 PM
The interviewer asked me about the projects that I wrote in my resume, Questions on the oops concept like what is the final block, the differences between java and c, other oops concepts, DBMS concurrency control, and os Memory Management.

1. Reverse Words In A String

Easy
10m average time
90% success
0/40
Asked in companies
Thought WorksFacebookApple

You are given a string 'str' of length 'N'.


Your task is to reverse the original string word by word.


There can be multiple spaces between two words and there can be leading or trailing spaces but in the output reversed string you need to put a single space between two words, and your reversed string should not contain leading or trailing spaces.


Example :
If the given input string is "Welcome to Coding Ninjas", then you should return "Ninjas Coding to Welcome" as the reversed string has only a single space between two words and there is no leading or trailing space.
Problem approach

First, I split the given string using a space (" ") delimiter and then store the results in array of strings. Used StringBuilder to append the string at the end by traversing the result string from the end.

Try solving now
02
Round
Hard
Online Coding Interview
Duration90 Minutes
Interview date3 Sep 2020
Coding problem2

Round2: The timing for this round is 2-3:30 PM
I solved the puzzle after some time so he modified the puzzle (Instead of 1 faulty jar there are two faulty jars now how will u find it?)
Later he asked me about my projects, cryptography, DBMS(concurrency control, os )

1. Smallest string

Easy
15m average time
85% success
0/40
Asked in companies
OracleAdobePracto

You are given two integers, ‘N’ and ‘V’. You need to construct a string having length ‘N’ and numeric value ‘V’.

The numeric value of a character is determined by its position in alphabets( 1- indexed)

For Example-

The numeric value of ‘a’ is 1, ‘b’ is 2.

The numeric value of a string is determined by adding the numeric value of all its characters.

For Example -

The numeric value of “bde” is 2 + 4 + 5, i.e. 11.

Example:

If 'N' = 3 and 'V' = 10, you need to construct string as “aah".
Problem approach

First, I applied the brute force approach:
Generated all the substring of string1 and check whether all the characters of string2 exist in the substring of s1. if all characters exist then compare the min_length( store length of substring which contains all characters of string 2) with a length of substring and if min_length> length of substring then update the min_length.

The interviewer agreed to this approach and asked me to improve this solution. Later I optimized it by using the sliding window technique and did the same problem in o(string_length).

Try solving now

2. Puzzle

Find the jar with contaminated pills.

03
Round
Medium
Online Coding Interview
Duration60 Minutes
Interview date3 Sep 2020
Coding problem2

Round 3: The interviewer asked me about the core concept of DBMS, OS. This round is held from 4-5 pm. In all rounds the interviewers are very supportive and will help you to think/solve the coding problem from Naive approach to optimized one.

1. DBMS Question

What are ACID Properties?

2. Operating System Questions

What are processes and threads?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

How do you remove whitespace from the start of a string?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 2 problems
Interviewed by Oracle
10749 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 10 problems
Interviewed by Oracle
6836 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Oracle
3010 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Oracle
1728 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
115097 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
58238 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
35147 views
7 comments
0 upvotes