SAP 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

Round duration - 60 Minutes
Round difficulty - Easy

The first round was conducted on HackerRank platform and comprised of 10 MCQs and 2 coding questions.
Both the coding questions expected optimised solution (brute force wouldn’t work).

Q1. 
Subarray Sums I Problem Statement
You are provided with an array of positive integers ARR that represents the strengths of different “jutsus” (ninja techniques). You are also given the strength of the ene...read more
Add your answer
Q2. 
Minimum Number of Platforms Problem
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Explanation:
Given two arrays:
• AT - represent...read more
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

The interview began with my introduction. The interviewer was very friendly and asked me a few questions about myself, my hobbies, etc.

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
Add your answer
Q2. 
Remove Duplicates Problem Statement
You are given an array of integers. The task is to remove all duplicate elements and return the array while maintaining the order in which the elements were provided.
...read more
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

This was conducted on the Codepair platform on HackerRank and the interviewer was in face-time with me. There were 3 questions to be coded.

Q1. 
Move Zeroes to End Problem Statement
Given an unsorted array of integers, modify the array such that all the zeroes are moved to the end, while maintaining the order of non-zero elements as they appear or...read more
Add your answer
Q2. 
Shape and Method Overriding Problem Statement
Create a base class called Shape that contains a field named shapeType and a method printMyType.
Implement two derived classes:
• Square: This class inheri...read more
Add your answer
Q3. 
DFS Traversal Problem Statement
Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It was a 60 minute online coding round. 2 programming questions were asked in this round.

Q1. 
Minimum Number of Platforms Problem
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Explanation:
Given two arrays:
• AT - represent...read more
Add your answer
Q2. 
Uncommon Characters Problem Statement
Given two strings S1 and S2 comprised of lowercase alphabets, determine the list of characters that are uncommon between these strings. A character is considered unco...read more
Add your answer

Round duration - 35 minutes
Round difficulty - Easy

The first one was a technical interview lasting for about 35 minutes. 
Firstly, he asked me to introduce myself. I told about my academics, family, achievements, strengths and hobbies. He asked about my father's occupation and what and why have I got to learn from his work. I told my hobbies as playing logical games and solving logical questions as well as net-surfing. 
He asked which type of websites do I visit and why. He asked me the areas of interest. And I told C, C++ and java. And, I prefer C++ more. He asked some basic theoretical questions. He gave me two programs to implement. Then, he gave me two SQL queries and also asked some questions on OS concepts. Then, he came to my project and asked about all my three projects done thoroughly with architecture and coding. 
Later, he asked two puzzles and I answered them correctly.

Q1. 
Swap Numbers Without Temporary Variable
Your task is to interchange the values of two numbers given as variables 'X' and 'Y' without using a temporary variable or any additional variable.
Explanation:
Y...read more
Add your answer
Q2. Explain the insertion and deletion of elements from a queue.
Add your answer
Q3. What is a deadlock, and what are the solutions to it?
Add your answer
Q4. What is process synchronization?
Add your answer
Q5. What is the difference between C and C++?
Add your answer
Q6. What is a friend function in Object-Oriented Programming?
Add your answer
Q7. What are the advantages of multithreading?
Add your answer
Q8. What is function overriding?
Add your answer