Oracle Cerner Software Developer Intern Interview Questions, Process, and Tips

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. Deletion in Circular Linked List
You are given a Circular Linked List of integers, and an integer, 'key'.
You have to write a function that finds the given key in the list and deletes it. If no s...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 by CodingNinjas
View 1 more answer
Q2. Move All Negative Numbers To Beginning And Positive To End
You are given an array 'ARR' consisting of 'N' integers. You need to rearrange the array elements such that all negative numbers a...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 by CodingNinjas
View 2 more answers

Round duration - 30-35 minutes
Round difficulty - Medium

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

Q1. Basic Interview Questions
They given me 2 table containing names of different cities and told me to apply left join on them.
1) Asked me about the Languages known. 
2) OOPS concepts. 
3) SQL concepts...read more
Add your answer

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
You have been given two integers ‘DAY_HOURS’ and ‘PARTS’. Where ‘DAY_HOURS’ is the number of hours in a day and a day can be divided into ‘PARTS’ equal parts. Your task is to find total in...read more
Ans. Brute Force
• This is a Naive/Brute Force approach
• Create a 2-d array of size ‘P’ rows and ‘D/P’ columns and assign 1 to ‘D’ value in each cell.
• Take an example with ‘D’ being 12 and ‘P’ being 2, then create an array [  [1,2,3,4,5,6]  [7,8,9,10,11,12]  ]
• Keep track of the number of prime group instances using a ‘PRIME_GROUP’ variable, which would be initialized to 0.
• We can easily observe that each column in th...read more
Answered by CodingNinjas
View 3 more answers

Round duration - 60 minutes
Round difficulty - Easy

Q1. Puzzle
There is a room with a door (closed) and three light bulbs. Outside the room, there are three switches, connected to the bulbs. You may manipulate the switches as you wish, but once you open the door...read more
Add your answer
Q2. Third greatest element
Given an array/list 'ARR' of ‘N’ distinct integers, you are supposed to find the third largest element in the given array 'ARR'.
Input Format :
The first line conta...read more
Ans. Sorting Based Approach
The idea is to sort the array in non-decreasing order, and then return the third element from the back of the array.
 
The steps are as follows :
1. Sort the array in non-decreasing order.
2. Return the third element from the back of the array.
Space Complexity: O(logn)Explanation:
O(1)
 
We are not using any extra space. Thus, the overall space complexity will be O(1).
Time Complexity: O(nlogn)Explan...read more
Answered by CodingNinjas
View 2 more answers
Q3. OOPS Questions
Basic concepts on OOPS was asked like:
Friend Function
Inheritance
Polymorphism
Abstraction
Encapsulation.
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. Technical Questions
This round was mainly based on my Projects and Tech Stack I used in my Projects.
Add your answer
Q2. OOPS Questions
Basic concepts of OOPS were asked like Inheritance, Polymorphism, Abstraction, and Encapsulation.
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. Basic HR Questions
What are your hobbies? or What are you passionate about? 
What are your biggest achievements till date? 
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

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

Q1. Puzzle
You have two ropes coated in oil to help them burn. Each rope will take exactly 1 hour to burn all the way through. However, the ropes do not burn at constant rates—there are spots where they burn a ...read more
Add your answer
Q2. Technical Questions
1. Dynamic memory allocation for 2d array
2. How polymorphism works in C++(Vptr and Vtable implementation)
 
Add your answer

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
Ninja is given an array of integers that contain numbers in random order. He needs to write a program to find and return the number which occurs the maximum times in the given inpu...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 by CodingNinjas
View 1 more answer
Q2. System Design Question
There is an online catalog of songs (Like Saavn or Gaana). How you will show favorite songs every day to users. An efficient algorithm required. (K max solution/ Min heap solution)
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. System Design Question
Design parking lot system
Add your answer
Q2. Zigzag Binary Tree Traversal
Given a binary tree, return the zigzag level order traversal of the nodes' values of the given tree. Zigzag traversal means starting from left to right, then right to left ...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 by CodingNinjas
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
You are given a binary tree, where the data present in each node is an integer. You have to find whether the given tree is symmetric or not.
Symmetric tree is a binary tree, whose mirro...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 by CodingNinjas
Add your answer
Q2. Search In Rotated Sorted Array
You have been given a sorted array/list ARR consisting of ‘N’ elements. You are also given an integer ‘K’.
Now the array is rotated at some pivot point unknown to you. For ...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 by CodingNinjas
View 1 more answer

Round duration - 90 mintues
Round difficulty - Easy

Timing it is around 11 am and Environment is good .

Q1. Reverse Stack Using Recursion
Reverse a given stack of integers using recursion.
Note:
You are not allowed to use any extra space other than the internal stack space used due to recursion.
You are not a...read more
Ans. Recursive Approach
We will be using two recursive methods:
1. To Reverse the Stack: We will use recursion to iterate through the stack. For each top element, we will pop it and use recursion to reverse the remaining stack. After getting the stack reversed by recursion we can simply push the popped element to the bottom of the stack. The procedure to push the element at the bottom of stack is explained in following paragraph...read more
Answered by CodingNinjas
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Environment was very friendly but questions asked are very hard.

Q1. Maximum subarray
Ninjas has been given an array. He wants to find a subarray such that the sum of all elements in the subarray is maximum.
Subarray 'A' is greater than sub-array 'B' if su...read more
Ans. Brute Force Approach
Our Brute force approach will figure out all the possible combinations possible. To find a subarray, we need to know both the starting point and the ending out of the array. We can make a loop that would iterate through the array. During each iteration, we will make another nested loop inside which will take all possible combinations where the starting index will be the pointer of the parent loop an...read more
Answered by CodingNinjas
View 1 more answer
Q2. Intersection of Linked List
You are given two Singly Linked List of integers, which are merging at some node of a third linked list.
Your task is to find the data of the node at which merging starts. If ...read more
Ans. Brute Force
• For each node in the first list, traverse the entire second list
• Check if any node in the second list coincides with the first list
  • If it does, return that node’s data
  • If it doesn’t, return -1
Space Complexity: O(1)Explanation:
O(1)
 
Since we only use constant space.
Time Complexity: O(m*n) - For 2d arraysExplanation:
O(N * M), where N and M are the lengths of the first and second linked lists respectively.&n...read more
Answered by CodingNinjas
View 2 more answers

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 a set into two subsets such that the difference of subset sums is minimum.
You are given an array containing N non-negative integers. Your task is to partition this array into two subsets such th...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
View 2 more answers

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
You are given a list of a repeated set of integers. Your task for the problem is to return a list of the given elements in decreasing sorted order of their frequency of repetitio...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
View 1 more answer
Q2. Reverse A Doubly Linked List
You are given a doubly-linked list of size 'N', consisting of positive integers. Now your task is to reverse it and return the head to the modified list.
Note:
A doub...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
View 2 more answers

Round duration - 30 Minutes
Round difficulty - Easy

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

Q1. Technical Questions
OS - Process Scheduling, Deadlock, Memory Management
DBMS - Normalisation, Joins, Foreign key
Ans. 
The question covers topics related to operating systems and database management systems.
• Process scheduling in operating systems involves determining the order in which processes are executed.

• Deadlock refers to a situation where two or more processes are unable to proceed because each is waiting for the other to release a resource.

• Memory management in operating systems involves allocating and managing memory resources f...read more
Answered by AI
Add your answer

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. 
 

Q1. Basic HR Questions
1)Do you have friends? Why we have friends?
2)Whether I have any other offer letters? 
3)Do I have any issues relocating to Hyderabad?

At last, he said I am selected and the company has...read more
Ans. 
Answering basic HR questions in an interview for SDE - Intern position.
• 1) Friends are important for social support, companionship, and emotional well-being.

• 2) No other offer letters at the moment.

• 3) No issues relocating to Hyderabad.

• Selected for the position with an increased package from 7lpa to 8lpa.
Answered by AI
Add your answer