Oracle Associate Software Developer Interview Questions and Answers

Basic one along with os, dbms fundamentals

One question can be solved using dp

Q1. Identify the longest palindromic substring
Ans. 
A palindromic substring is a string that reads the same forwards and backwards.
• Use dynamic programming to find the longest palindromic substring.

• Start by considering each character as the center of a potential palindrome.

• Expand outwards from each center to check for palindromic property.

• Keep track of the longest palindromic substring found so far.

• Example: Input 'babad', Output 'bab' or 'aba'.
Answered by AI
Add your answer
Q2. Questions based on resume/projects
Add your answer

Verbal, quants and logical reasoning. 160mins duration

Dynamic programming questions on tree and linked lists

The online test consisted of 4 sections, Aptitude, logical reasoning, Computer Programming and English Comprehension.

Q1. Technical round where questions on core DBMS concepts were asked.
Add your answer

Questions related to DSA, Basic English, Operating System and DBMS

2 Coding Questions related to trees and graphs

Q1. What are the fundamentals of OOPS?
Ans. 
OOPS fundamentals include encapsulation, inheritance, polymorphism, and abstraction.
• Encapsulation: Bundling data and methods together in a class.

• Inheritance: Creating new classes from existing ones, inheriting their properties and behaviors.

• Polymorphism: Objects of different classes can be treated as objects of a common superclass.

• Abstraction: Hiding complex implementation details and providing simplified interfaces.
Answered by AI
View 1 more answer
Q2. What were your projects during college?
Add your answer
Q3. Some basic queries related to SQL.
Add your answer
Q4. Write down the code for LCA of a binary Tree.
Ans. 
Code for finding the Lowest Common Ancestor (LCA) of a binary tree.
• Start by checking if the root is null or equal to either of the given nodes. If so, return the root.

• Recursively search for the LCA in the left and right subtrees.

• If both nodes are found in different subtrees, return the root as the LCA.

• If both nodes are found in the same subtree, continue searching in that subtree.
Answered by AI
View 1 more answer

Q1. Why do you want to join Oracle?
Add your answer
Q2. What makes you a suitable candidate for the job?
Add your answer