Oracle Cerner Mern Full Stack Developer Interview Questions and Answers for Experienced

Q1. Java Collection, OOPS, Seralization
Add your answer

Q1. Java OOPS, Collection, threading, SQL
Add your answer

Q1. Nothing specific, Salary Negotiations.
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This was a test round where 10 aptitude based questions were to be solved in 60 minutes

Q1. You have 5 pirates and 100 gold coins. The challenge is to determine how the pirates will divide the coins among themselves based on their ranking and the rules they follow.
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

They took us to the lab for this on and we were each given a paper with a program on it. It was all mixed as in each person got a different paper, You have around an hour to finish coding. after which you have to explain your code. They also gave wrong or incorrect inputs and see how your code handles these exceptions.

Q1. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. 
Reverse a given string containing alphabets, numbers, and special characters.
• Iterate through the string from the end to the beginning and append each character to a new string.

• Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.

• Handle special characters and numbers along with alphabets while reversing the string.

• Ensure to consider the constraints provided in th...read more
Answered by AI
Add your answer
Q2. 
K Largest Elements Problem Statement
Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.
Input:
The fir...read more
Ans. 
Implement a function to find K largest elements in an unsorted array in non-decreasing order.
• Create a min heap of size K and insert the first K elements of the array

• For each remaining element, if it is larger than the root of the heap, replace the root with the element and heapify

• Finally, the heap will contain the K largest elements in non-decreasing order
Answered by AI
Add your answer
Q3. 
Remove Character from String Problem Statement
Given a string str and a character 'X', develop a function to eliminate all instances of 'X' from str and return the resulting string.
Input:
The first lin...read more
Ans. 
Develop a function to remove all instances of a given character from a string.
• Iterate through the string and build a new string excluding the specified character.

• Use a StringBuilder or similar data structure for efficient string manipulation.

• Handle edge cases like empty string or character not found in the input string.

• Ensure the function completes within the given time constraint.
Answered by AI
Add your answer
Q4. 
Triangle of Numbers Pattern
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
Example:
Input:
N = 4
Output:
   1
  232
 34545
4567654
Explanation:
The pat...read more
Ans. 
Print a triangle pattern of numbers based on a given number 'N'.
• Iterate through each row and column to determine the numbers to print

• Use a combination of spaces and numbers to align the pattern correctly

• Increment the numbers in each row based on the row number
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Compared to the other round this is more tech oriented. Lot more tech questions. It is of normal difficulty and is not that hard to clear, you only need to know the basics.
Very basic of Data Structure and Oracle knowledge enough. Lots of simple questions from data structures(insert into heaps etc). They did not ask to write code for DS, but rather to explain the logic through diagrams. For some complicated question, they expect how much you brainstorm ideas in solving

Q1. 
Convert Binary Tree to Mirror Tree
Convert a given binary tree into its mirror tree, where the left and right children of all non-leaf nodes are interchanged.
Input:
An integer ‘T’ denoting the number o...read more
Ans. 
Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.
• Traverse the tree in postorder fashion and swap the left and right children of each node.

• Use recursion to solve the problem efficiently.

• Modify the binary tree in place without creating a new tree.
Answered by AI
Add your answer
Q2. 
Heap Sort Problem Statement
Given an array ARR consisting of N integers, your task is to use the Heap sort algorithm to arrange the array in non-decreasing order.
Input:
The first line of the input cont...read more
Ans. 
Implement the Heap sort algorithm to arrange an array in non-decreasing order.
• Implement the Heap sort algorithm to sort the given array in non-decreasing order

• Use a max heap to sort the array in non-decreasing order

• Time complexity of Heap sort is O(n log n)
Answered by AI
Add your answer
Q3. What is indexing in the context of databases?
Ans. 
Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.
• Indexes are created on specific columns in a database table to speed up queries that search for data in those columns.

• Indexes work similar to the index of a book, allowing the database to quickly locate the desired data without having to scan the entire table.

• Examples of indexes in...read more
Answered by AI
Add your answer
Q4. Which data structure is better for your use case: a B Tree or a Hash Table?
Ans. 
Hash Table is better for fast lookups and insertions, while B Tree is better for range queries and ordered traversal.
• Use Hash Table for fast lookups and insertions with O(1) average time complexity.

• Use B Tree for range queries and ordered traversal with O(log n) time complexity.

• Consider the size of the dataset and the specific operations needed to determine the best data structure.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This round lasted for around 30 minutes. It more of a character analysis round with a lot of HR type questions.