Siemens Healthcare Software Developer Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

30 Aptitude problems and two coding questions

Q1. 
Count Inversions Problem Statement
Given an integer array ARR of size N, your task is to find the total number of inversions that exist in the array.
An inversion is defined for a pair of integers in the...read more
Ans. 
Count the total number of inversions in an integer array.
• Iterate through the array and for each pair of elements, check if the conditions for inversion are met.

• Use a nested loop to compare each pair of elements efficiently.

• Keep a count of the inversions found and return the total count at the end.
Answered by AI
Add your answer
Q2. 
Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Out...read more
Ans. 
Find the maximum sum of any contiguous subarray within an array of integers.
• Iterate through the array and keep track of the maximum sum of subarrays encountered so far.

• At each index, decide whether to include the current element in the subarray or start a new subarray.

• Use Kadane's algorithm to solve the problem efficiently.

• Example: For array [34, -50, 42, 14, -5, 86], the maximum subarray sum is 137.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Data structure and algorithms plus object oriented problems

Q1. 
Merge Sort Problem Statement
You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.
Explanation:
The Merge Sort...read more
Ans. 
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
• Divide the input array into two halves recursively until each array has only one element.

• Merge the sorted halves to produce a completely sorted array.

• Time complexity of Merge Sort is O(n log n).

• Example: Input: [3, 1, 4, 1, 5], Output: [1, 1, 3, 4, 5]
Answered by AI
Add your answer
Q2. 
Problem Statement: Delete Node In A Linked List
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...read more
Ans. 
Given a singly linked list of integers and a reference to a node, delete the specified node from the linked list.
• Traverse the linked list to find the node to be deleted

• Update the pointers to skip over the node to be deleted

• Print the modified linked list after deletion
Answered by AI
Add your answer

Round duration - 60 miinutes
Round difficulty - Easy

Database questions and discussion about projects

Q1. What is a normal form in database management systems, and can you explain Boyce-Codd Normal Form (BCNF)?
Ans. 
Normal forms in database management systems help in organizing data to reduce redundancy and improve data integrity.
• Normal forms are rules used to design relational database tables to minimize redundancy and dependency.

• Boyce-Codd Normal Form (BCNF) is a stricter version of Third Normal Form (3NF) where every determinant is a candidate key.

• BCNF helps in eliminating anomalies like insertion, update, and deletion anomalie...read more
Answered by AI
Add your answer
Q2. What is the difference between the 'WHILE' keyword and the 'HAVING' keyword in SQL?
Ans. 
WHILE is used in loops to repeatedly execute a block of code, while HAVING is used in SQL queries to filter results based on aggregate functions.
• WHILE is used in programming languages like SQL to create loops for executing a block of code multiple times.

• HAVING is used in SQL queries to filter results based on aggregate functions like SUM, COUNT, AVG, etc.

• WHILE is used for iterative operations, while HAVING is used for
Answered by AI
Add your answer

Q1. Core Java questions
Add your answer

Q1. Oops, c#, design , .net framework
Add your answer

Q1. Managerial, projects
Add your answer

Two Easy questions to be solved

Q1. Some Technical based questions
Add your answer
Q2. It was amazing . Interviewer asked me to code for heap sort and asked me to explain.
Add your answer
Q3. Write a code for heap sort algorithm and explain it?
Ans. 
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
• Heap sort works by building a binary heap from the array and then repeatedly extracting the maximum element and placing it at the end of the array.

• The heap is maintained as a complete binary tree, where each parent node is greater than or equal to its children.

• The time complexity of heap sort is O(n log n) and it is an in-place sor...read more
Answered by AI
Add your answer

It was an MCQ based test. Code Snippets as well as OOPS, OS, DBMS questions were there

Q1. How to implement a stack OS Questions Problem Solving Questions OOPS concepts DS questions
Add your answer

Q1. Smart Pointers About the project done in college
Add your answer

IT was basic question from string and array

Q1. Data structure question find all leaf node from tree.
Ans. 
Use depth-first search to traverse the tree and identify leaf nodes.
• Implement depth-first search algorithm to traverse the tree.

• Identify nodes with no children as leaf nodes.

• Store leaf nodes in an array for retrieval.
Answered by AI
Add your answer
Q2. Print sentence word in reverse order without using default function. eg: input:-> I live in New York. output:-> I evil ni weN kroY.
Ans. 
Reverse each word in a sentence without using default function.
• Split the sentence into words

• Iterate through each word and reverse it

• Join the reversed words back into a sentence
Answered by AI
Add your answer

Q1. Programming question :Fibonacci series using recursion.
Ans. 
Fibonacci series using recursion is a classic programming problem where each number is the sum of the two preceding ones.
• Define a recursive function that takes an integer n as input

• Base case: if n is 0 or 1, return n

• Recursive case: return the sum of the previous two Fibonacci numbers

• Call the function recursively with n-1 and n-2 until base case is reached
Answered by AI
Add your answer
Q2. Programming question: Find 1st 2nd and 3rd highest from array of integer.
Ans. 
Find 1st, 2nd, and 3rd highest integers from an array.
• Sort the array in descending order.

• Retrieve the first three elements from the sorted array.

• Handle cases where array length is less than 3.
Answered by AI
Add your answer

Q1. They asked Puzzle
Add your answer

Q1. Salary Discussion
Add your answer