Oracle Software Engineer Intern Interview Questions and Answers for Freshers

Q1. Basic SQL queries
Add your answer
Q2. Quantitative question and pattern matching
Add your answer
Q3. Simple interests and ratios
Add your answer

Q1. Project Based technical questions
Add your answer
Q2. Database concepts
Add your answer
Q3. Java Fundamentals
Add your answer

Q1. Java Implementations
Add your answer
Q2. Code writing and DSA solutions
Add your answer

Q1. Career interests and goals
Add your answer
Q2. Hobbies, interests, and passion
Add your answer

Basic aptitude with logical and verbal and reasoning.also microprocessor and micro controller.

We were divided into 10 and ques were asked from dbms,ds,os,cn

Q1. Longest Valid Parentheses
Ans. 
Find the length of the longest valid parentheses substring in a given string.
• Use a stack to keep track of the indices of opening parentheses.

• Iterate through the string and update the maximum length of valid parentheses.

• Handle cases where closing parentheses are encountered without a matching opening parentheses.
Answered by AI
Add your answer
Q2. Find the maximum number in the subarrays of length k.
Ans. 
Find the maximum number in the subarrays of length k.
• Iterate through the array and keep track of the maximum number in each subarray of length k.

• Use a sliding window approach to efficiently find the maximum number in each subarray.

• Time complexity can be optimized to O(n) using a deque data structure.
Answered by AI
Add your answer

Q1. Spiral Matrix Question
Add your answer

Good level question. I have qualified for the next round

Basic to intermediate question, Cleared the test

Q1. Tell me about yourself and introduce yourself
Add your answer

It was easy round with 2 questions from hacker rank

Q1. Implement Linked list
Ans. 
Linked list is a data structure where each node points to the next node.
• Create a Node class with data and next pointer

• Create a LinkedList class with head pointer

• Implement methods to add, remove, search, and traverse the list
Answered by AI
Add your answer
Q2. Implement Hash Map with array and linked list.
Ans. 
Implement Hash Map with array and linked list.
• Create an array of linked lists

• Hash function maps keys to array indices

• Insert key-value pairs into linked lists

• Handle collisions by chaining

• Search for a key by hashing and traversing linked list
Answered by AI
Add your answer
Q3. How to create a immutable class in java
Ans. 
To create an immutable class in Java, follow these steps:
• Make the class final

• Make all fields private and final

• Do not provide any setter methods

• Initialize all fields via constructor

• If any field is mutable, return a clone of it instead of the original object
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Easy

After round 1 there was a break of 15 mins and the coding round started.
We had a choice to attempt the exam in R language & SQL or python & sql
I chose python and sql
It had 8 questions 4 python and 4 sql

Q1. Longest Common Subsequence
Given two strings, 'S' and 'T' with lengths 'M' and 'N', find the length of the 'Longest Common Subsequence'.
For a string 'str'...read more
Ans. Memoization
Let the two strings be x and y. 
Let x(i) be the substring of x from index 0 to index i. 
Let c[i, j] be the length of the longest common subsequence of strings x(i) and y(j).
Then the recurrence relation to find c[i, j] is as follows:
We can use this relation to write a simple recursive program but instead of recomputing the results of subproblems, compute them just once and store their results in a l...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 15 minutes
Round difficulty - Medium

The interview was mostly analytical based and how you approach the round a few technical questions in dbms and oops were also asked.

Q1. Aptitiude Questions
In one box there are 12 red and 12 green balls and in another box there are 24 res and 24 green balls.
You have two balls choose from each of the box with replacement such that they have ...read more
Add your answer
Q2. Technical Questions
What is an immutable object and why is it useful
Acid properties in dbms
Explain atomicity and what is d in acid.
Add your answer

Round duration - 20 Minutes
Round difficulty - Medium

Similar to first round
For Shortlists after elimination from first round.

Q1. Car Pooling
You are working as a cab driver. Your car moves in a straight line and moves toward the forward direction only. Initially, you have ‘C’ empty seats for the passengers.
Now, you are given ‘N’ ...read more
Ans. Hash Map Implementation
The simple idea is that we will keep a record of the number of passengers changed at every time in a hash map ‘passengers’ where the key represents the time at which the number of passengers changed and the value at that key represents the count of passengers changed. 
 
For Example- If we have trips = [ 2, 1,4 ], [ 2, 2,5 ] then at time = 1, no of passengers changed and increased by 2. S...read more
Answered by CodingNinjas
View 1 more amswer
Q2. General Questions
Top 5 best things that happened during covid lockdown for you.
Byjus bussiness model
Why is it better to have online coaching classes
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

After two technical round interviews, the last round was a hr interview. The whole process can take up one whole day or more and your interview can be at any time
My process started at 5 pm and ended at 10:30 pm
All the interviewers were very friendly no pressure.

Q1. Nth Fibonacci Number
Nth term of Fibonacci series F(n), where F(n) is a function, is calculated using the following formula -
    F(n) = F(n-1) + F(n-2), 
    Where, F(1) = F(2) = 1
Provided N you have...read more
Ans. Recursive Approach
• In this approach, we use recursion and uses a basic condition that :
  • If ‘N’ is smaller than ‘1’(N<=1) we return ‘N’
  • Else we call the function again as ninjaJasoos(N-1) + ninjaJasoos(N-2).
• In this way, we reached our answer.
Space Complexity: O(n)Explanation:
O(N),  where ‘N’ is the given number.  
As recursion uses a stack of size ‘N’
Time Complexity: O(2^n)Explanation:
O(2^N), where ‘N’ i...read more
Answered by CodingNinjas
View 2 more amswers
Q2. Basic HR Questions
The most difficult situation you had overcome
A situation where you brought the best in another person
If in a situation with four people including you come up with a better solution than t...read more
Add your answer