Oracle Cerner Software Developer Intern Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

Round 1  was a coding round of 60 min which started around 5:30PM in which 2 problem statements were given. The questions were based on Array and linked list. The platform used for test was coding which was user friendly and which use to display number of test cases passed and some test cases were hidden.

Q1. 
Problem: Deletion in Circular Linked List
You are provided with a Circular Linked List of integers and a specific integer, referred to as 'key'.
Your task is to implement a function that locates the spec...read more
Ans. Recursion
The idea is to use a recursive approach to find the given key and then remove that node. The recursive idea is very clear that we will traverse through the circular linked list, and we will check if the value of the node is equal to the given key. 
 
We will define a function deleteNodeHelper(root, key, head) to remove the key in which the head is the starting node of the linked list, and we will send ...read more
Answered Anonymously
Add your answer
Q2. 
Rearrange Array: Move Negative Numbers to the Beginning
Given an array ARR consisting of N integers, rearrange the elements such that all negative numbers are located before all positive numbers. The orde...read more
Ans. Using Sorting
Approach: A brute force approach could be to just sort the given array in ascending order. This will result in all negative numbers to appear at the beginning and positive number at the end.
Space Complexity: O(1)Explanation:
O(1)
 
Because no extra space is required.
Time Complexity: O(nlogn)Explanation:
O(N*logN), where N is the number of elements in the array.
 
In the worst case, sorting requires O...read more
Answered Anonymously
Add your answer

Round duration - 30-35 minutes
Round difficulty - Medium

This round was of technical interview and they asked me various concepts

Round duration - 150 minutes
Round difficulty - Medium

It was an online round consisting of 2 programming questions restricted to C++, Java, and C# and 10 MCQ's on Data structures, Algorithms, etc..

Q1. 
Prime Time Again Problem Statement
You are given two integers DAY_HOURS and PARTS. Consider a day with DAY_HOURS hours, which can be divided into PARTS equal parts. Your task is to determine the total ins...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Find the Third Greatest Element
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
Input:
The first line contains a single integer 'T' representing the numb...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. Can you describe your projects and the tech stack you used in them?
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

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

Round duration - 90 mintues
Round difficulty - Easy

Timing it is around 11 am and Environment is good .

Q1. 
Reverse Stack with Recursion
Reverse a given stack of integers using recursion. You must accomplish this without utilizing extra space beyond the internal stack space used by recursion. Additionally, you ...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Environment was very friendly but questions asked are very hard.

Q1. 
Maximum Subarray Problem Statement
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...read more
Add your answer
Q2. 
Intersection of Linked List Problem
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...read more
Add your answer

Round duration - 150 Minutes
Round difficulty - Easy

2 programming questions restricted to C++, Java, and C#
10 MCQ's on Data structures, Algorithms, etc.

Q1. 
Partition Array Minimizing Subset Sum Difference
Given an array containing N non-negative integers, your task is to partition this array into two subsets such that the absolute difference between their su...read more
Ans. 
The task is to partition an array into two subsets such that the absolute difference between subset sums is minimum.
• Iterate through all possible subsets of the array

• Calculate the sum of each subset

• Find the minimum absolute difference between the subset sums
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

The round was conducted on FaceCode(HackerEarth) in the afternoon time. The OOPS features of CPP were asked. The SQL queries (Joins) were also asked. Two easy programming questions were asked - one array-based implementation and other one from the doubly linked list. Two puzzles were also asked. The interviewers were very nice and they gave me enough time to think about the solution.

Q1. 
Sort Elements by Frequency
Your task is to sort a list of repeated integers by their frequency in decreasing order. The element with the highest frequency should appear first. If two elements have the sam...read more
Ans. 
The task is to sort a list of integers based on their frequency of repetition, with the element with the highest frequency first.
• Count the frequency of each element in the list using a dictionary.

• Sort the elements based on their frequency in descending order.

• If two elements have the same frequency, maintain their original order.

• Return the sorted list.
Answered by AI
Add your answer
Q2. 
Reverse a Doubly Linked List
Given a doubly linked list of positive integers with size 'N', reverse the list and return the head of the modified list.
Explanation:
A doubly linked list allows traversal ...read more
Ans. 
The task is to reverse a given doubly linked list and return the head of the modified list.
• Create three pointers: prev, current, and next.

• Iterate through the linked list and update the next and prev pointers for each node.

• Finally, update the head pointer to the last node visited and return it as the head of the reversed list.
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

In this round, I was asked simple questions from core subjects.
 

Round duration - 10 Minutes
Round difficulty - Easy

It was in the evening on the same day after Techno Managerial round. HR asked me about my family background.