AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Oracle
Compare
Filter interviews by
Oracle Full Stack Developer Interview Questions, Process, and Tips
Top Oracle Full Stack Developer Interview Questions and Answers
- Q1. Find All Pairs Adding Up to Target Given an array of integers ARR of length N and an integer Target , your task is to return all pairs of elements such that they add up ...read more
- Q2. Bursting Balloons Problem Given an array ARR of size N , where each element represents the height of a balloon. The task is to destroy all balloons by shooting arrows fr ...read more
- Q3. Validate BST Problem Statement Given a binary tree with N nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true ; otherwise, retur ...read more
Oracle Full Stack Developer Interview Experiences
2 interviews found
Gopi Karthikeyan S
Delete nodes from linkedList if their value matches a certain condition
(3 Questions)
- Q1. Js advanced concepts
- Q2. Java concurrency
- Q3. Design patterns
(3 Questions)
- Q1. Implement few design patterns
- Ans.
Implementing design patterns in software development
Singleton pattern ensures a class has only one instance and provides a global point of access to it
Factory pattern creates objects without specifying the exact class of object that will be created
Observer pattern defines a one-to-many dependency between objects so that when one object changes state, all its dependents are notified and updated
- Q2. Questions of microservice architecture
- Q3. Java 8 tricky coding questions
Skills evaluated in this interview
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
It was the screening round he asked me 2 questions
First one is easy and other one is medium type
- Q1.
Find All Pairs Adding Up to Target
Given an array of integers
ARRof lengthNand an integerTarget, your task is to return all pairs of elements such that they add up to theTarget.Input:
The first line ... - Ans.
Find all pairs of elements in an array that add up to a given target.
Iterate through the array and store each element in a hashmap along with its index.
For each element, check if the target minus the element exists in the hashmap.
If found, print the pair of elements. If not found, print (-1, -1).
- Q2.
Root to Leaf Path Problem Statement
Given a binary tree with 'N' nodes numbered from 1 to 'N', your task is to print all the root-to-leaf paths of the binary tree.
Input:
The first line of the input con... - Ans.
Given a binary tree, print all root-to-leaf paths in order.
Traverse the binary tree from root to leaf nodes, keeping track of the path nodes.
Use depth-first search (DFS) to explore all possible paths.
Return each path as a string of nodes separated by spaces.
Handle cases where nodes have NULL values by skipping them in the path.
Ensure the order of nodes in each path is maintained.
(2 Questions)
Round duration - 45 Minutes
Round difficulty - Easy
This is the first round in the loop interviews. Are you familiar with Javascript. Why do we use js. How do you use js to change the value of a textbox.
- Q1.
Validate BST Problem Statement
Given a binary tree with
Nnodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, returntrue; otherwise, returnfalse.A binary search tree (BST)...
- Ans.
Validate if a binary tree is a Binary Search Tree (BST) based on given properties.
Check if the left subtree of a node contains only nodes with data less than the node's data.
Verify if the right subtree of a node contains only nodes with data greater than the node's data.
Ensure that both the left and right subtrees are also binary search trees.
Iterate through the tree in level order form to validate the BST properties.
- Q2.
Construct Tree from Preorder Traversal
Given a list of integers
pre[]of sizen, representing the preorder traversal of a special binary tree where each node has 0 or 2 children, and a boolean arrayisLea... - Ans.
Construct a binary tree from preorder traversal and leaf node information.
Create a binary tree using preorder traversal and leaf node information
Use recursion to build the tree
Handle both leaf and non-leaf nodes appropriately
Round duration - 45 minutes
Round difficulty - Easy
It was the team fit round
(1 Question)
Round duration - 45 Minutes
Round difficulty - Medium
4tn round in the loop, he asked me to design a game. He focused both on backend and frontend.
..
- Q1.
Bursting Balloons Problem
Given an array
ARRof sizeN, where each element represents the height of a balloon. The task is to destroy all balloons by shooting arrows from left to right. When an arrow hits... - Ans.
Find the minimum number of arrows needed to burst all balloons by shooting arrows from left to right.
Sort the array in ascending order to make it easier to determine the minimum number of arrows needed.
Iterate through the sorted array and count the number of times the height decreases.
The count of height decreases plus 1 gives the minimum number of arrows needed to burst all balloons.
(1 Question)
Round duration - 45 Minutes
Round difficulty - Medium
Another problem solving round
- Q1.
Triplets with Given Sum Problem
Given an array or list
ARRconsisting ofNintegers, your task is to identify all distinct triplets within the array that sum up to a specified numberK.Explanation:
A t...
- Ans.
Identify all distinct triplets within an array that sum up to a specified number.
Iterate through the array and use nested loops to find all possible triplets.
Check if the sum of the triplet equals the specified number.
Print the valid triplets or return -1 if no triplet exists.
Interview Preparation Tips
Tip 1 : clear your basics in ds algo
Tip 2 : problem solving is must to Crack coding interview
Tip 3 : solve leetcode problem as much as you can
Tip 1 : it should be short as possible
Tip 2 : you must have mentioned your past experience in chronological order with descriptions
Skills evaluated in this interview
Full Stack Developer Jobs at Oracle
Interview questions from similar companies
Software Developer Interview Questions & Answers
Microsoft Corporation
Anonymous
posted on 19 May 2022
I appeared for an interview before May 2021.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1.
Spiral Order Traversal of a Binary Tree Problem Statement
Given a binary tree with 'N' nodes, your task is to print the nodes in spiral order traversal.
Example:
Input:
The binary tree is represented i...
- Ans.
Print nodes of a binary tree in spiral order traversal.
Use a queue to perform level order traversal of the binary tree.
Alternate between printing nodes from left to right and right to left at each level.
Handle null nodes represented by '-1' appropriately.
Example: For input '1 2 3 -1 -1 4 5 -1 -1 -1 -1', the output should be '1 3 2 4 5'.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1.
Word Break Problem Statement
You are given a list of
Nstrings calledA. Your task is to determine whether you can form a given target string by combining one or more strings fromA.The strings from
Ac... - Ans.
Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.
Iterate through all possible combinations of strings from the list to form the target string.
Use recursion to try different combinations of strings.
Check if the current combination forms the target string.
Return true if a valid combination is found, otherwise return false.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1. Design an elevator system.
- Ans.
Design an elevator system for efficient vertical transportation.
Divide building into zones to optimize elevator usage.
Implement algorithms for efficient elevator scheduling.
Include safety features like emergency stop buttons and overload sensors.
Consider user interface for passengers to select floors and monitor elevator status.
Interview Preparation Tips
Tip 1 : Never give up
Tip 2 : Practice
Tip 3 : Be positive
Tip 1 : Keep it short
Tip 2 : Highlight skills and achievements
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 120minutes
Round difficulty - Easy
It was an online MCQ's + coding round consisting of 20 MCQ’s and 1 coding problem.
- Q1. Check whether there exists a loop in the linked list.
- Ans.
Check for a loop in a linked list by using two pointers moving at different speeds.
Use two pointers, one moving at double the speed of the other.
If there is a loop, the two pointers will eventually meet at the same node.
Example: 1 -> 2 -> 3 -> 4 -> 5 -> 2 (loop back to 2), the two pointers will meet at node 2.
(1 Question)
Round duration - 50 minutes
Round difficulty - Easy
The interview started at 8:30 pm in cc of Delhi Technological University itself and it was quite late. There was only a single interviewer and he asked me one coding question related to overflow of integers.
- Q1. How can you check for integer overflow when multiplying two integers and ensure the result is stored correctly within an integer type?
- Ans.
To check for integer overflow when multiplying two integers, use the properties of integer overflow and check if the result is within the valid range of the integer type.
Check if the signs of the two integers are the same to avoid overflow in case of multiplication.
Use the properties of integer overflow to detect if the result exceeds the maximum or minimum value of the integer type.
Consider using a larger data type or...
Round duration - 15 minutes
Round difficulty - Easy
It was quite late . There was only one interviewer and I was asked about my family , education and future plannings and few questions related joining locations and documents etc.
Interview Preparation Tips
Focus on data structures and algorithms part more. Tell the interviewer , starting from the brute force approach to the most optimal solution as this will give a good impression to the interviewer.
Application resume tips for other job seekersTo be honest, the problem-solving ability is the only thing that most companies care about. So you can manipulate your resume according to that. Mention your competitive programming handles in your resume and also other coding ranks or achievements which you have achieved.
Final outcome of the interviewSelectedSkills evaluated in this interview
I applied via Naukri.com and was interviewed in Sep 2020. There were 3 interview rounds.
Interview Questionnaire
1 Question
- Q1. Questions about Comptel Eventlink tool, Perl scripting, unix shell scripting and a bit a SQL
Interview Preparation Tips
I appeared for an interview before Mar 2021.
(2 Questions)
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
- Q1.
Reverse Words in a String: Problem Statement
You are given a string of length
N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o... - Ans.
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
Handle leading, trailing, and multiple spaces appropriately
- Q2.
Reverse a Stack Using Recursion
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...
- Ans.
Reverse a stack using recursion without using any extra space other than the internal stack space.
Use recursion to pop all elements from the original stack and store them in function call stack.
Once the stack is empty, push the elements back in reverse order.
Base case of recursion should be when the original stack is empty.
(2 Questions)
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
- Q1.
Convert a Binary Tree to its Mirror Tree
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...
- Ans.
Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.
Traverse the binary tree in a recursive manner.
Swap the left and right children of each non-leaf node.
Continue this process until all nodes have been processed.
- Q2.
Remove Nth Node from End of Linked List
You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...
- Ans.
Remove the Kth node from the end of a singly linked list.
Use two pointers approach to find the Kth node from the end.
Handle edge cases like removing the head node or removing the last node.
Update the pointers to remove the Kth node and reconnect the list.
Round duration - 30 minutes
Round difficulty - Easy
Typical Managerial round.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Preparation Tips
College Name: NIT SURATHKAL
I appeared for an interview in Oct 2016.
Interview Questionnaire
5 Questions
- Q1. What is inheritance?
- Ans.
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
Inheritance allows for code reuse and promotes modularity.
The class that is being inherited from is called the superclass or base class.
The class that inherits from the superclass is called the subclass or derived class.
The subclass can access the public and protected members of the superclass.
Inhe...
- Q2. Regular expressions in PhP
- Ans.
Regular expressions in PHP are powerful tools for pattern matching and manipulating strings.
Regular expressions are defined using the preg_match() function in PHP.
They are used to search, replace, and validate strings based on specific patterns.
Regex patterns consist of a combination of characters and special symbols.
Modifiers can be added to the pattern to control the matching behavior.
Common regex functions in PHP in...
- Q3. What is polymorphism? Explain using a real life example
- Ans.
Polymorphism is the ability of an object to take on many forms. It allows objects of different classes to be treated as the same type.
Polymorphism allows a single interface to be used for different types of objects.
It enables code reusability and flexibility in object-oriented programming.
For example, a parent class 'Animal' can have multiple child classes like 'Dog', 'Cat', and 'Bird'. They can all be treated as 'Anim...
- Q4. Discussion about projects.
- Q5. Aggregate functions in dbms? And query questions related to that.
Interview Preparation Tips
Experience: 10 questions of aptitude containing English paragraph solving , Maths aptitude and also logical reasoning. Other 3 questions were of programming in any language comfortable.Two of the questions were partially done.In one of them only the logic was to be coded and in the other the error was to be corrected to give the correct output.
Duration: 1 hour 20 minutes
Total Questions: 13
Round: Technical Interview
Experience: They test your basic knowledge of programming, databases and how well you have worked with your projects.
There are actually three more rounds. 2 technical and one HR. I was not selected for them. Out of 40 students only 5 were selected after the final round.
Skills: Basic C/C++, DBMS, Multiple And Multi-level Inheritance, Polymorphism, PHP, Regular Expressions
College Name: Thapar University, Patiala
Skills evaluated in this interview
I appeared for an interview in Dec 2016.
Interview Questionnaire
8 Questions
- Q1. Given a 10 digit number, sort the individual digits of the number.
- Ans.
Sort the individual digits of a 10 digit number.
Convert the number to a string to access individual digits
Use a sorting algorithm to sort the digits
Convert the sorted digits back to a number
- Q2. Write code for LCA in Binary Search Tree.
- Ans.
The code for finding the Lowest Common Ancestor (LCA) in a Binary Search Tree (BST).
Start from the root node and compare it with the given two nodes.
If both nodes are smaller than the current node, move to the left subtree.
If both nodes are greater than the current node, move to the right subtree.
If one node is smaller and the other is greater, then the current node is the LCA.
Continue this process until the LCA is fou
- Q3. Discuss a DBMS consisting of college faculty, professors, courses and students.
- Ans.
A DBMS for managing college faculty, professors, courses, and students.
The DBMS should have tables for faculty, professors, courses, and students.
Each table should have appropriate attributes to store relevant information.
Relationships can be established between tables using foreign keys.
Queries can be used to retrieve information about faculty, professors, courses, and students.
The DBMS can be used to track enrollment
- Q4. What extra curricular activities did you do in college?
- Ans.
I was actively involved in coding competitions, hackathons, and programming clubs during college.
Participated in coding competitions such as ACM ICPC and Codeforces
Attended hackathons to work on real-world projects and improve problem-solving skills
Joined programming clubs to collaborate with peers and learn new technologies
- Q5. Do you seek for help if stuck in a problem?
- Ans.
Yes, I believe in seeking help when stuck in a problem as it leads to faster resolution and learning.
I believe in collaborating with team members to brainstorm solutions
I am not afraid to ask for help from more experienced developers
I utilize online resources like Stack Overflow or documentation when needed
- Q6. What do you understand by teamwork?
- Ans.
Teamwork is collaborating with others towards a common goal, utilizing each member's strengths and skills.
Collaborating with others towards a common goal
Utilizing each member's strengths and skills
Communicating effectively and openly
Respecting and valuing diverse perspectives
Sharing responsibilities and supporting each other
Celebrating successes as a team
- Q7. How do you tackle something that you can't find a solution to?
- Ans.
When faced with an unsolvable problem, I break it down, research, seek help, experiment, and iterate until a solution is found.
Break down the problem into smaller, manageable parts
Research and gather information related to the problem
Seek help from colleagues, online communities, or experts
Experiment with different approaches or solutions
Iterate and refine the solution based on feedback and results
- Q8. Where do you want to see yourself after 5 years?
- Ans.
In 5 years, I see myself as a senior software developer leading a team of developers on innovative projects.
Leading a team of developers on innovative projects
Senior software developer role
Continuing to learn and grow in the field
Interview Preparation Tips
Experience: The test had a time limit. Every 10 minutes you had to do atleast 4 questions. It was quite fast paced. The questions were from basic coding, aptitude and debugging.
Tips: Learn to be fast at coding. Study from geeksforgeeks.com. Practice a lot of aptitude questions. Have a decent knowledge of basic coding.
Duration: 1 hour
Total Questions: 20
Round: Technical Interview
Experience: The interviewer started off by asking basic sorting questions. Followed by data structures and algorithms. And DBMS related questions in the end.
Tips: Have a good presence of mind. Understand the question asked properly. Be confident and keep discussing. Don't get nervous and solve the questions incorrectly. Have good grip over topics like sorting, DS, Algorithms and DBMS.
Round: Managerial Interview
Experience: There was a discussion upon the company's work in fields like Big Data, IoT. They asked me in detail about the projects mentioned in my CV. Other skills mentioned in CV were also discussed.
Tips: Have a good understanding of the projects you have mentioned in your CV. Be polite and confident while answering. Keep a general awareness of the current technical scenario.
Round: HR Interview
Experience: The round was based around my over all personality. They checked how would I be an asset to their company. They analysed my core values and capabilities of working in a team.
Tips: Show that you are willing to work in a team. Be confident and polite. Express your feelings and passion towards your job and the company. Explain your college extra curricular activities well.
College Name: IIT Varanasi
Skills evaluated in this interview
Interview Preparation Tips
Experience: 1 Psychometric Test
2. Analytical Aptitude
3 Logical Reasoning
4 Two coding Questions
5.Pattern Recognition
6.Essay writing
Tips: Do the coding Question first ,they are mot important ,if ur code doesn't run u are disqualified.
Practice on leetcode
Sectional Cutoff
Duration: 100 mins minutes
Total Questions: 103
Round: Test
Experience: Data base design of an ATM.E-R diagrams ,Class diagram and Normalization
Discussion on projects
A simple coding question
Heavy ball light ball puzzle
Cloud Computing
Public and Private Cloud
CRM ,SRM ,ERP
Asked me Floyd's Warshall Algo,told to implement it in a question
SQL queries
Round: Technical Interview
Experience: 1 asked me a puzzle man and bridge wid torch
2.asked me about TRIES
3.difference between primary key and unique key
4.asked to write query for nth highest salary
5.Asked me as sql injection
6. AES ,DES
7.Reverse a linked list
Round: Behavioural Interview
Experience: The interviewer was above 50.
1.Introduce yourself
2.why sap
3.situation based questions
Round: HR Interview
Experience: The lady was tough ...showed her intent in the PPT as well..
1.asked me about profile preference
2.about family
3.where would you see in next 2 years
4.why sap
5.nything about sap not mentioned in ppt(i was like null)
6.location preference
Skills:
College Name: NIT Srinagar
Oracle Interview FAQs
Tell us how to improve this page.
Oracle Interviews By Designations
- Oracle Software Developer Interview Questions
- Oracle Application Developer Interview Questions
- Oracle Software Engineer Interview Questions
- Oracle Senior Software Engineer Interview Questions
- Oracle Member Technical Staff Interview Questions
- Oracle Applications Engineer Interview Questions
- Oracle Senior Consultant Interview Questions
- Oracle Associate Consultant Interview Questions
- Show more
Interview Questions for Popular Designations
- Full Stack Software Developer Interview Questions
- Senior Full Stack Developer Interview Questions
- Java Full Stack Developer Interview Questions
- Mern Full Stack Developer Interview Questions
- Full Stack Engineer Interview Questions
- Full Stack Web Developer Interview Questions
- Php Full Stack Developer Interview Questions
- full stack .net developer Interview Questions
- Show more
Oracle Full Stack Developer Interview Process
based on 1 interview
Interview experience
Full Stack Developer Interview Questions from Similar Companies
Fast track your campus placements
Oracle Full Stack Developer Reviews and Ratings
based on 5 reviews
Rating in categories
|
Senior Software Engineer
2.5k
salaries
|  ₹10.3 L/yr - ₹40 L/yr |
|
Principal Consultant
2.1k
salaries
| ₹10.9 L/yr - ₹37 L/yr |
|
Senior Consultant
2.1k
salaries
| ₹9.1 L/yr - ₹25 L/yr |
|
Senior Member of Technical Staff
1.8k
salaries
| ₹13.4 L/yr - ₹45 L/yr |
|
Senior Application Engineer
1.4k
salaries
| ₹9.7 L/yr - ₹30 L/yr |
SAP
MongoDB
Salesforce
IBM
- Home >
- Interviews >
- Oracle Interview Questions >
- Oracle Full Stack Developer Interview Questions
