Oracle Software Developer Intern Interview Questions, Process, and Tips

45 minutes
arrays, strings,
SHL

Q1. Find number of nodes in a tree and it's time complexity
Ans. 
To find number of nodes in a tree, perform a depth-first or breadth-first traversal and count the nodes. Time complexity is O(n).
• Perform a depth-first or breadth-first traversal of the tree

• Count the nodes as you traverse the tree

• Time complexity is O(n) where n is the number of nodes in the tree
Answered by AI
Add your answer
Q2. What is abstraction and how do you implement it ??
Ans. 
Abstraction is the concept of hiding complex implementation details and showing only the necessary information.
• Abstraction allows developers to focus on the essential features of an object or system.

• It helps in reducing complexity and improving efficiency in software development.

• Implement abstraction in programming by using abstract classes and interfaces.

• Example: In a car, we don't need to know the internal workings o...read more
Answered by AI
Add your answer

Q1. What is the minimum number of coins to reach the target with the coins 1,2,5
Ans. 
The minimum number of coins to reach a target amount can be calculated using dynamic programming.
• Use dynamic programming to calculate the minimum number of coins needed to reach the target amount.

• Start by initializing an array to store the minimum number of coins needed for each amount from 0 to the target amount.

• Iterate through the coin denominations and update the minimum number of coins needed for each amount based
Answered by AI
Add your answer
Q2. Byte stream to human readable format without using library
Ans. 
Convert byte stream to human readable format without using library
• Iterate through the byte stream and convert each byte to its ASCII character representation

• Concatenate the ASCII characters to form the human readable format

• Handle special characters and edge cases appropriately
Answered by AI
Add your answer

1hr mostly was c questions focusing on pointers, arrays and strings. Few logical questions were there too

2hrs, 5 questions. 1 easy and 4 medium. All leetcode type problems with arrays, strings and matrix

2hrs, simple application development like creating a backend for shopping application. Only simple functions like adding products, quantity, ordering, if quantity is not there then refuse the order and such. Was not asked for DB implementations.

Q1. How to merge a list of sorted arrays in sorted order?
Ans. 
Merge sorted arrays using a min heap to maintain sorted order.
• Create a min heap and insert the first element from each array into the heap.

• Pop the smallest element from the heap and add it to the result array.

• Replace the popped element in the heap with the next element from the same array.

• Continue this process until all elements are merged.
Answered by AI
Add your answer
Q2. Simple discussions about oops, project etc
Add your answer

Q1. Self introduction for 2 mins
Add your answer
Q2. Why do you want to join Zoho?
Add your answer
Q3. What kinda word does Zoho do
Ans. 
Zoho is a software company that provides cloud-based business applications.
• Zoho offers a suite of productivity and collaboration tools such as Zoho CRM, Zoho Books, and Zoho Projects.

• Zoho's products are designed to help businesses manage their operations more efficiently.

• Zoho's software is cloud-based, allowing users to access their data from anywhere with an internet connection.
Answered by AI
Add your answer

Coding round was there. Two coding questions were asked to solve in 1 hour. The difficulty was easy to medium.Leetcode questions of arrays and strings.

Q1. It was an online tech interview. There were two panelists. One asked me about my projects and gave me one coding question to solve which was based on matrices. And i was supposed to explain the approach an...read more
Add your answer
Q2. After solving the question. In the same interview zoom meet HR asked me something about me and my family and thats it.
Add your answer

OnCampus Test including DSA Questions

Q1. Introduce yourself
Add your answer
Q2. DSA Question based on Dynamic Programming
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

It was a telephonic round. The interview asked me these questions.
 

Round duration - 60 Minutes
Round difficulty - Medium

The interviewer started asking me questions. He gave me 2 problems. He was giving hints in case of any issues.
 

Q1. 
Maximum Frequency Number Problem Statement
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...read more
Ans. Brute Force Approach
Here, we can simply run two loops. The outer loop picks all elements one by one and the inner loop finds the frequency of the picked element and compares it with the maximum present so far.
 
Algorithm:
 
• Declare 4 variables as ‘maxFrequency’ , ‘currentFrequency’ , ‘maxElement’ , ‘currentElement’ and initialize them with 0
• Run a loop from ‘i’ = ‘0’ to ‘N’
  • Set ‘currentElement’ as arr[i] and ‘curr...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This was a technical interview. He gave me these questions one by one.
1. Again, how polymorphism works. Draw vtable and vptr
2. Producer consumer problem with synchronization
3. Difference between mutex, semaphore, and condition_variable.
4. Design parking lot system
5. Zigzag traversal of binary tree

Q1. Design a parking lot system.
Add your answer
Q2. 
Zigzag Binary Tree Traversal Problem Statement
Determine the zigzag level order traversal of a given binary tree's nodes. Zigzag traversal alternates the direction at each level, starting from left to rig...read more
Ans. Iterative Approach
Our very basic intuition is that we are going to traverse the given binary tree using level order traversal where we just need to modify one thing that for every alternate level we need to reverse the order that level. 
 
Steps are as follows:
 
1. Create an empty queue.
2. For each node, first, the node is visited and then it’s child nodes are added in the queue if they exist(First in first out).
3. ...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

1. He asked about the producer-consumer problem but I told him that the same question is asked in the previous round.
Then interviewer went asking lots of questions related to producer and consumer. Lots of discussions like what is a writer is not there and the only reader is there and you need to find out how many readers are currently reading from the buffer.
2. Discussions about C++11 features. How thread and async is different
3. Design your own shared_ptr(How you will handle ownership)
4. Check If the binary tree is symmetrical.
5. Find elements in a rotated sorted array and then optimize it.

Q1. 
Tree Symmetricity Problem Statement
You are provided with a binary tree structure, where each node consists of an integer value. Your task is to determine whether this binary tree is symmetric.
A symmetr...read more
Ans. Inorder And Reverse Inorder
We do two inorder traversals recursively of the tree simultaneously. For the first traversal, we traverse the left child first and then the right child, and in the second traversal, we traverse the right child first and then the left child. Let cur1 and cur2 be the current nodes of the first and second traversals respectively and initially both of them are passed as root. Then the algorithm f...read more
Answered Anonymously
Add your answer
Q2. 
Search In Rotated Sorted Array Problem Statement
Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
Note:
1. If 'K' is not present...read more
Ans. Naive Approach
Naively traverse the array and find if ‘K’ is present in ARR or not. If ‘K’ is present in ARR return its index else return -1.
Space Complexity: O(1)Explanation:
O(1), i.e. constant space complexity. 
Time Complexity: O(n)Explanation:
O(N), where N is the length of the array/list. 
 
We are iterating over the array/list ARR once. Hence, the time complexity is O(N).

Java (SE 1.8)

/*

    Time Compl...read more
Answered Anonymously
Add your answer