AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
SAP
Compare
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
SAP Software Developer Intern Interview Questions, Process, and Tips
Top SAP Software Developer Intern Interview Questions and Answers
- 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 ...read more
- Q2. 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 ...read more
- Q3. 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 ad ...read more
SAP Software Developer Intern Interview Experiences
4 interviews found
Anonymous
I applied via Campus Placement and was interviewed in Aug 2024. There were 3 interview rounds.
45 minutes
arrays, strings,
SHL
(2 Questions)
- 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
- 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...
(2 Questions)
- 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
- 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
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in Jul 2021. There were 4 interview rounds.
Interview Questionnaire
3 Questions
- Q1. 1) Data Structures and Algorithm (DSA): Mostly focused on Array, linked list and stacks.
- Q2. 2) 2 puzzles.
- Q3. 3) SQL queries
Interview Preparation Tips
Coding Test: 2 questions in 45 minutes. Difficulty of questions was Easy.
Round 1: Array and linked list based coding question, project discussion.
Round 2: Array, stack and pattern problem. SQL queries. Puzzles (Moderate lvel)
Round 3: HR round
I appeared for an interview in Jan 2021.
(2 Questions)
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
ARRthat represents the strengths of different “jutsus” (ninja techniques). You are also given the strength of the ene... - Ans.
Count the number of subarrays whose combined strength matches the given enemy strength.
Iterate through all subarrays and calculate their sum to check if it matches the enemy strength.
Use two pointers technique to efficiently find subarrays with sum equal to the enemy strength.
Consider edge cases like when the enemy strength is 0 or when all elements in the array are equal to the enemy strength.
- 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...
- Ans.
Determine the minimum number of platforms needed at a railway station so that no train has to wait.
Sort the arrival and departure times arrays in ascending order.
Use two pointers to iterate through the arrays and keep track of the number of platforms needed.
Increment the number of platforms needed when a train arrives and decrement when a train departs.
Return the maximum number of platforms needed at any point.
(2 Questions)
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 ofARRin non-descending order using the Merge Sort algorithm.Explanation:
The Merge Sort...
- 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]
- 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.
...
- Ans.
Remove duplicates from an array while maintaining order.
Use a set to keep track of unique elements.
Iterate through the array and add elements to the set if not already present.
Convert the set back to an array to maintain order.
(3 Questions)
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...
- Ans.
Move all zeroes to the end of an unsorted array while maintaining the order of non-zero elements.
Iterate through the array and maintain two pointers - one for non-zero elements and one for zeroes.
Swap non-zero elements with zeroes to move zeroes to the end of the array.
Maintain the relative order of non-zero elements while moving zeroes to the end.
- Q2.
Shape and Method Overriding Problem Statement
Create a base class called
Shapethat contains a field namedshapeTypeand a methodprintMyType.Implement two derived classes:
- Square: This class inheri...
- Ans.
Create base class Shape with field shapeType and method printMyType. Implement Square and Rectangle classes with calculateArea method.
Create a base class Shape with shapeType field and printMyType method.
Implement Square and Rectangle classes inheriting from Shape.
Include additional fields and methods in Square and Rectangle classes.
Override printMyType method in Square and Rectangle classes to output their respective ...
- Q3.
DFS Traversal Problem Statement
Given an undirected and disconnected graph
G(V, E), whereVis the number of vertices andEis the number of edges, the connections between vertices are provided in the 'GR... - Ans.
DFS traversal to find connected components in an undirected and disconnected graph.
Use Depth First Search (DFS) algorithm to traverse the graph and find connected components.
Maintain a visited array to keep track of visited vertices.
For each unvisited vertex, perform DFS to explore all connected vertices and form a connected component.
Repeat the process until all vertices are visited and print the connected components.
Interview Preparation Tips
Tip 1 : Only write what your confident in cv
Tip 2 : Practice ds and algo problems with consistency
Tip 3 : Prepare for company specific questions
Tip 1 : Skills relevant to Job Description
Tip 2 : Be confident about things mentioned in cv
Skills evaluated in this interview
What people are saying about SAP
I appeared for an interview before Jan 2021.
(2 Questions)
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...
- Ans.
Determine the minimum number of platforms needed at a railway station so that no train has to wait.
Sort the arrival and departure times arrays in ascending order.
Use two pointers to iterate through the arrays and keep track of the number of platforms needed.
Increment the number of platforms needed when a train arrives and decrement when a train departs.
Return the maximum number of platforms needed at any point in time.
- Q2.
Uncommon Characters Problem Statement
Given two strings
S1andS2comprised of lowercase alphabets, determine the list of characters that are uncommon between these strings. A character is considered unco... - Ans.
Given two strings, find uncommon characters in lexicographical order.
Iterate through each character in both strings and keep track of their frequency using a hashmap.
Iterate through the hashmap and add characters with frequency 1 to the result list.
Sort the result list in lexicographical order and return it as the final output.
(8 Questions)
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...
- Ans.
Swap two numbers without using a temporary variable.
Use bitwise XOR operation to swap the values of X and Y without using a temporary variable.
The XOR operation works by toggling the bits of the numbers.
Example: X = 10, Y = 20. X = X XOR Y, Y = X XOR Y, X = X XOR Y. After swapping, X = 20, Y = 10.
- Q2. Explain the insertion and deletion of elements from a queue.
- Ans.
Elements can be inserted at the back of the queue and deleted from the front.
To insert an element, use the 'enqueue' operation to add it to the back of the queue.
To delete an element, use the 'dequeue' operation to remove it from the front of the queue.
Insertion and deletion operations in a queue have a time complexity of O(1).
- Q3. What is a deadlock, and what are the solutions to it?
- Ans.
A deadlock is a situation in which two or more processes are unable to proceed because each is waiting for the other to release a resource.
Deadlock occurs when processes have acquired resources and are waiting for additional resources that are held by other processes.
Four necessary conditions for deadlock are mutual exclusion, hold and wait, no preemption, and circular wait.
Solutions to deadlock include prevention, avo...
- Q4. What is process synchronization?
- Ans.
Process synchronization is the coordination of multiple processes to ensure they do not interfere with each other while accessing shared resources.
Preventing race conditions by using synchronization mechanisms like locks, semaphores, and monitors
Ensuring mutual exclusion to prevent multiple processes from accessing shared resources simultaneously
Implementing synchronization to maintain the order of execution and avoid ...
- Q5. What is the difference between C and C++?
- Ans.
C is a procedural programming language while C++ is an object-oriented programming language with features like classes and inheritance.
C is a procedural programming language, while C++ is a multi-paradigm language with support for object-oriented programming.
C does not support classes and objects, while C++ does.
C does not have features like inheritance and polymorphism, which are present in C++.
C is a subset of C++, m...
- Q6. What is a friend function in Object-Oriented Programming?
- Ans.
A friend function in OOP is a function that is not a member of a class but has access to its private and protected members.
Friend functions are declared inside a class with the 'friend' keyword.
They can access private and protected members of the class.
They are not member functions of the class, but have the same access rights as member functions.
Friend functions are often used for operator overloading or to allow exte...
- Q7. What are the advantages of multithreading?
- Ans.
Multithreading allows for concurrent execution of tasks, improving performance and responsiveness.
Improved performance by utilizing multiple CPU cores efficiently
Enhanced responsiveness as tasks can run concurrently without blocking each other
Better resource utilization by allowing tasks to be executed in parallel
Facilitates easier handling of complex tasks by breaking them into smaller threads
Examples: Web servers han...
- Q8. What is function overriding?
- Ans.
Function overriding is when a subclass provides a specific implementation of a method that is already provided by its parent class.
Occurs in inheritance when a subclass has a method with the same name and parameters as a method in its superclass
The method in the subclass overrides the method in the superclass
Used to achieve runtime polymorphism in object-oriented programming
Example: class Animal { void sound() { System...
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
SAP interview questions for designations
Interview questions from similar companies
Interview Questionnaire
20 Questions
- Q1. He asked me my specialization?
- Q2. Why not further studies? (He had noted that I was third in my batch. He appeared impressed by that
- Q3. He asked me to tell him about my favorite project
- Q4. He then looked at my grades. He commented that my lowest grade – B- was in Digital Image Processing. I just looked at him like a doofus thinking of what to say. But he quickly added, ‘don’t worry, it happe...
- Q5. He then asked me a question that had been asked in Round 4, written test:Describe an optimal algorithm to find the second minimum number in an array of numbers. What is the exact number of comparisons requ...
- Q6. Given a polygon (could be regular, irregular, convex, concave), find out whether a particular point lies inside it or outside it
- Ans.
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
- Q7. He asked me to explain Canny’s algorithm to him. (this was because my DIP project was related to this)
- Q8. Then, he gave me a practical problem to solve: Suppose you are given an image which contains some text and some photos. How do you find the location of the image?
- Q9. Which are the four storage classes in C
- Ans.
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
- Q10. Given a program: int i; int main() { int j; int *k = (int *) malloc (sizeof(int)); … } Where are each of these variables stored?
- Ans.
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
- Q11. Question on polymorphisms
- Q12. He again went back to the first question he had asked me. Once again
- Q13. Then he wrote out some code and asked me how the compiler will generate code for it. I gave some answer, but he was clearly not satisfied. I thought it was all over by then. Then, he asked me a DIP quest...
- Q14. Given a set of words one after another, give me a data structure so that you’ll know whether a word has appeared already or not
- Ans.
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
- Q15. He asked me some questions on Interprocess Communication: What’s a semaphore? How are they used? He would often pick out words from my answers and ask me what they meant. He wanted to make sure that I rea...
- Q16. He then asked me some DB fundas. Transaction. Serializability, Consistent state, etc
- Q17. Finally, he asked me whether I had any questions
- Q18. There is a clock at the bottom of the hill and a clock at the top of the hill. The clock at the bottom of the hill works fine but the clock at the top doesn’t. How will you synchronize the two clocks. Obv...
- Q19. There was one more puzzle.. I don’t remember it. but I do remember that we started discussing ways of generating large prime numbers
- Q20. We also talked a bit about my phone browser project
Interview Preparation Tips
Duration: 15 minutes
Total Questions: 1
Round: Test
Duration: 30 minutes
Total Questions: 2
Round: Test
Duration: 30 minutes
Total Questions: 3
Round: Test
Total Questions: 4
Round: Technical Interview
Experience: 1.When I told him that I had none as I didn’t want to specialize in this stage, he was a little surprised but appeared satisfied with my reason.2.I told him that my profile clearly indicated that I’ve been trying to get into the industry via internships, industry-funded projects right from second year, second sem. I said that I was fully sure that I didn’t want to do MS anytime soon.3.I told him about the web-browser that I had developed for cell-phones. I thought that was the only project which was closest to what Adobe was working on. He appeared satisfied with my answers.4. So people, be fully prepared to explain any anomalous grades. I was prepared with the explanation of the W in the my grade-sheet but not of the B- in DIP. I know that this is really stupid considering that I was interviewing with Adobe. Don’t make this mistake.5.I screwed up, big time in this question. I had superficially discussed this question with my friend a while ago and he had outlined an algorithm which I thought that I had understood, but I hadn’t. I started off explaining it but got stuck in the middle. He sternly told me to read it up again. One solution that I could tell him, and which I had written in the test was this Use two variables – min and second min. Initialize them by comparing the first two elements of the array. This is (1) comparison. Then, go through the entire array, from index 2 to n-1 comparing each element, first with min and then with second min, updating each variable as necessary. This will involve a worst case of two comparisons for each element. Therefore, total number of comparisons = 2*(n-2) + 1 = 2*n – 3 comparisons.I’ll try to update this with a better solution, sometime soon.6.This is an easy, straight question from graphics. You shoot a ray parallel to the x-axis passing through this point. Start with odd parity. Change parity of ray each time it intersects an edge of the polygon (consider special case of when the line passes through a vertex of the polygon. Change parity only if it passes through a vertex which has one edge above it and one edge below the ray). If the parity of ray is even when it passes through the point, it is inside the polygon, else it is not.7.This is simple. Study DIP8.I gave various alternatives – from searching for RGB components, to using OCR.. he didn’t appear fully satisfied. I think he was looking for edge-detection, but that would fail, if the text contained tables, etc.
Round: Technical Interview
Experience: He was friendly at the start but this interview was my worst. He asked me my favorite subject. I said that it was Programming. (He laughed at that)
1. static, extern, register, auto2.I started off correctly, but he was able to confuse me. He brought in shared libraries, static libraries fundas into the discussion. We had a discussion for about twenty-minutes on this. Finally, he was happy with one of my answers because I had deduced which policy made sense and answered correctly. He said that out of all the people interviewed so far (I was second last), nobody had been able to answer all of these questions correctly.3.this is easy – get it from any C++ book. He tried to confuse me again, but this time I was ready and he was finally satisfied.Then he looked at my grades and said that out of all your grades, you have only two Bs and one of them is in Compilers. Why? (Damn it. three non-A grades and that’s all they ask about. What’s wrong with this world?!)Didn’t you like Compilers? “Not in particular”, I replied. “Fine. Now, I HAVE to ask you questions on compilers”, he said.4.He again went back to the first question he had asked me. Once again5.I first suggested that we capture only a small portion of the board. To locate that portion, we could search for the chalk in the prof’s hand – of course, taking care that it had the blackboard in the background (no point capturing a video of the prof scratching his chin, na?). Further, if the prof was writing only text, we could convert the video into text by OCR and then transmitting. Simple diagrams could also be reduced to a set of vector-graphics instructions (we rarely, see the prof shading stuff). I think he liked my approach, but was not completely satisfied. Anyway, we left it at that and went forward.6.I suggested various alternatives. but he kept helping me and finally, we came up with an array of pointers to 26-trees (each node of the tree has 26 children). Store every word as a path from the root to a leaf with pointers in the correct places. For example, hello would be stored as – pointer from ‘h’ index of the root array to a node which had a pointer from ‘e’ index of it’s array to a node which had a pointer from ‘l’ index of the array.. and so on. This is both time and space efficient.7.I was able to answer all his questions, but I made the mistake of telling him, when we started off that I didn’t know much about this subject as I had done it a long time ago. He was very annoyed at that, apparently because a lot of people before me had said this.8.I was able to answer all of them. I stumbled around a bit in a few questions where I was explaining correctly, but not using the keywords that he was looking for.9.I thought that I should say something to make him realize that I was not completely stupid and so asked him whether there was any logic to the order in which the short-listed candidates were called. This turned out to be a dumb move. The order was alphabetic and he sent me off with a parting shot, saying “You guys do pattern recognition and stuff and still you can’t recognize such a simple pattern” Me and my big mouth! Moral of the story: Don’t ask questions for the sake of asking.
Round: Puzzle Interview
Experience: After the first two interviews, this one was like having a warm batch after being cold and wet for days! I did well in this one.1.You have to go up the hill and come back, with horse, without horse, getting four equations to solve four unknowns – time to go uphill – with horse, without horse, time to go downhill – with horse, without horse. Then you can go up the hill and set the clock to ‘(time when you left) + (time to go uphill with horse)’2. I told him the funda of Mersenee primes (luckily remembered it) and he was decently impressed.
General Tips: Finally hired by Adobe. Special thanks to AmbitionBox team. Really amazing site for sharing experience. That’s all for the Adobe. They are focusing on your approach and your coding skills. All the best.
Skills: Algorithm, Data structure, C++, C, DIP
College Name: BIT Mesra
Skills evaluated in this interview
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer asked me 2 questions related to DS/Algo in this round . Both the questions were of Easy-Medium difficulty and I was also required to code them in a production ready manner.
- Q1.
Maximum Sum Path in a Binary Tree Problem Statement
You are provided with a binary tree consisting of
Nnodes where each node has an integer value. The task is to determine the maximum sum achievable by a... - Ans.
Find the maximum sum achievable by a simple path between any two nodes in a binary tree.
Traverse the binary tree to find all possible paths and calculate their sums.
Keep track of the maximum sum encountered during traversal.
Consider paths that may include the same node twice.
Implement a recursive function to explore all possible paths.
Handle cases where nodes have negative values.
- Q2.
Intersection of Two Arrays Problem Statement
Given two arrays
AandBwith sizesNandMrespectively, both sorted in non-decreasing order, determine their intersection.The intersection of two arrays in...
- Ans.
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal, and update the intersection array.
Return the intersection array as the result.
(3 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DS/Algo to solve under 50 minutes and one question related to Operating Systems.
- Q1.
Next Greater Element Problem Statement
You are provided with an array or list
ARRcontainingNpositive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.T...
- Ans.
Find the Next Greater Element for each element in an array.
Iterate through the array from right to left
Use a stack to keep track of elements with no greater element to the right
Pop elements from the stack until finding a greater element or stack is empty
- Q2.
Number In Arithmetic Progression Problem
Given three integers
X,C, andY, whereXis the first term of an arithmetic sequence with a common difference ofC, determine ifYis part of this arithmetic sequ... - Ans.
Check if a given number is part of an arithmetic sequence with a given first term and common difference.
Calculate the arithmetic sequence using the formula: nth term = X + (n-1) * C
Check if Y is equal to any term in the sequence to determine if it belongs to the sequence
Return 'True' if Y belongs to the sequence, otherwise return 'False'
- Q3. Can you define process and threads in operating systems?
- Ans.
Processes are instances of programs in execution, while threads are smaller units within a process that can execute independently.
A process is a program in execution, consisting of code, data, and resources.
Threads are smaller units within a process that can execute independently.
Processes have their own memory space, while threads share the same memory space within a process.
Processes are heavyweight, while threads ar...
(3 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.
- Q1.
Max Product Subset Problem Statement
Given an array/list
arrof sizen, determine the maximum product possible by taking any subset of the array/listarr. Return the result modulo10^9+7since the product ... - Ans.
Find the maximum product of a subset of an array modulo 10^9+7.
Iterate through the array and keep track of the maximum positive product and minimum negative product encountered so far.
Handle cases where the array contains zeros separately.
Return the maximum product modulo 10^9+7.
- Q2.
Populating Next Right Pointers in Each Node
Given a complete binary tree with 'N' nodes, your task is to determine the 'next' node immediately to the right in level order for each node in the given tree.
... - Ans.
Implement a function to update 'next' pointers in a complete binary tree.
Iterate level by level using a queue
Connect nodes at each level using 'next' pointers
Handle null nodes appropriately
Ensure the tree is a complete binary tree
- Q3. You have two wires of different lengths that are both capable of burning for exactly one hour when ignited at both ends. How can you measure a time interval of 45 minutes using these two wires?
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This round consisted of 2 questions from DSA where I was first asked to explain my approach to the interviewer with proper complexity analysis and then code the problems. The interviewer was quite friendly and also provided me some hints when I was stuck.
- Q1.
Stack with getMin Operation
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...
- Ans.
Implement a stack with push, pop, top, isEmpty, and getMin operations in O(1) time complexity without using extra space.
Use two stacks - one to store the actual elements and another to store the minimum element at each level.
When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.
When popping an element, also pop from the minimum stack if the popped element is t...
- Q2.
Split Array Into Maximum Subarrays Problem Statement
You are given an integer array
arrof sizeN. Your task is to split the array into the maximum number of subarrays such that the first and last occurre... - Ans.
Given an array, split it into maximum subarrays with first and last occurrence of each element in a single subarray.
Iterate through the array and keep track of the first and last occurrence of each element.
Use a hashmap to store the indices of each element.
Split the array whenever the last occurrence of an element is found.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Questionnaire
12 Questions
- Q1. Given a binary tree and an integer x, return whether the binary tree has a path from root to a leaf whose values sum to x
- Q2. Gievn a binary tree and return all root to leaf node pathss row,col and value
- Ans.
Return all root to leaf node paths in a binary tree with row, col and value.
Traverse the binary tree recursively and keep track of the current path.
When a leaf node is reached, add the path to the result array.
Include row, col and value of each node in the path.
Use an array of strings to store the paths.
- Q3. He then asked me to give test cases for testing this program
- Q4. Given two unsorted arrays of numbers and asked me to find the intersection
- Q5. GetMax() function for a stack in O(1)
- Ans.
To get max value from a stack in O(1), maintain a separate stack to keep track of maximum values.
Create a separate stack to keep track of maximum values
Push the maximum value onto the stack whenever a new maximum is encountered
Pop the maximum value stack whenever the top element of the main stack is popped
Return the top element of the maximum value stack to get the maximum value in O(1)
- Q6. GetMax() function for a queue in O(1)
- Ans.
To get max element from a queue in O(1) time complexity
Maintain a separate variable to keep track of the maximum element in the queue
Update the maximum element variable whenever a new element is added or removed from the queue
Return the maximum element variable when getMax() function is called
- Q7. Given an array in which consecutive elements differ by 1, i.e. a[i] – a[i + 1] = 1 or -1, and an element x, find the element in the array
- Q8. Given an array, find the Next Greatest Element to the right for each element
- Ans.
Find the Next Greatest Element to the right for each element in an array of strings.
Iterate through the array from right to left
Use a stack to keep track of elements
Pop elements from stack until a greater element is found
If no greater element is found, assign -1
Return the result array
- Q9. Given an expression, remove unnecessary parenthesis. For example if (((a + b)) * c) is given make it (a + b) * c, as it evaluates in the same way without those parenthesis also
- Ans.
To remove unnecessary parenthesis from an expression, we need to apply a set of rules to identify and eliminate them.
Identify and remove parenthesis around single variables or constants
Identify and remove parenthesis around expressions with only one operator
Identify and remove parenthesis around expressions with operators of equal precedence
Identify and remove parenthesis around expressions with operators of different ...
- Q10. Given an array of integers, find the maximum product which can be formed by three numbers
- Ans.
Find the maximum product of three integers in an array.
Sort the array in descending order.
Check the product of the first three numbers and the product of the first and last two numbers.
Return the maximum of the two products.
- Q11. Given an array of integers, find the length of the longest consecutive sub array which forms an AP
- Ans.
Find length of longest consecutive sub array forming an AP from given array of integers.
Sort the array in ascending order
Iterate through the array and find the longest consecutive sub array forming an AP
Use a variable to keep track of the length of the current consecutive sub array forming an AP
Use another variable to keep track of the length of the longest consecutive sub array forming an AP seen so far
- Q12. Given a binary tree, connect all the nodes at the same level. Each node will have a next pointer; you have to make it point to the next node to its right in the same level. If there is no such node, make ...
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 90 mintues
Round difficulty - Easy
Timing it is around 1 pm, Environment is very friendly.
- Q1.
Equilibrium Index Problem Statement
Given an array
Arrconsisting of N integers, your task is to find the equilibrium index of the array.An index is considered as an equilibrium index if the sum of elem...
- Ans.
Find the equilibrium index of an array where sum of elements on left equals sum of elements on right.
Iterate through the array and calculate the total sum of elements.
For each index, calculate the sum of elements on the left and right side and check for equilibrium.
Return the left-most equilibrium index found, or -1 if none exist.
- Q2.
Maximum Meetings Problem Statement
Given the schedule of N meetings with their start time
Start[i]and end timeEnd[i], you need to determine which meetings can be organized in a single meeting room such ... - Ans.
Given N meetings with start and end times, find the maximum number of meetings that can be organized in a single room without overlap.
Sort the meetings based on end times.
Iterate through the sorted meetings and select the next meeting whose start time is greater than or equal to the end time of the previous meeting.
Return the selected meetings in the order they are organized.
(2 Questions)
Round duration - 90 mintues
Round difficulty - Hard
Timing it is around 1 pm and Environment is good .
- Q1. Explain how to overload the pre and post-increment operators in object-oriented programming.
- Ans.
Overloading pre and post-increment operators in OOP involves defining special member functions for the class.
Define member functions for pre-increment (++obj) and post-increment (obj++) operators in the class.
For pre-increment, return a reference to the modified object after incrementing the value.
For post-increment, return a copy of the original object before incrementing the value.
Example: class Counter { int value; ...
- Q2.
Longest Zero Sum Subarray Problem
Given an array of integers consisting of both positive and negative numbers, find the length of the longest subarray whose sum is zero. This problem will be presented wit...
- Ans.
Find the length of the longest subarray with zero sum in an array of integers.
Iterate through the array and keep track of the running sum using a hashmap.
If the running sum is seen before, it means there is a subarray with zero sum.
Calculate the length of the subarray with zero sum and update the maximum length found so far.
Interview Preparation Tips
Tip 1 : Practice Atleast 500 Questions
Tip 2 : Do atleast 1 good projects
Tip 3 : You should be able to explain your project
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Skills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. Off-campus interviews in Bangalore
Interview Preparation Tips
Experience: Only a few students will get shortlisted who do all the questions correctly.
Round: Other Interview
Experience: First 4 rounds on day 1 and this are just to shortlist for more rounds on some other day.
Tips: They will focus on almost all the concepts of computer science.You need to practice a lot and start it right now. Should be easy if you have prepared well enough. Use your holidays to start preparing for placements.
General Tips: Sooner you start, better your placement will be as lack of practice & last day study works only for exams but never for interviews. You'll get enough time to prepare for interviews once you get shortlisted. Focus on it even if you are placed already.
Skill Tips: They will focus on almost all the concepts of computer science.
Skills: C , Aptitude
College Name: NIT SURATHKAL
I appeared for an interview in Dec 2016.
Interview Preparation Tips
Experience: On-site interview (5 hours).
4 back-to-back 45-minute coding interviews, followed by a design interview, with a lunch break with a Googler in the middle.
The first coding interview was a set of (surprisingly) trivial (no algorithms needed) incremental coding questions.
The two next coding interviews were problems straight from the "Cracking the coding interview" book. Even though I divulged that I'd solved pretty much exactly the same problem before, they didn't give me an alternative problem and I quickly coded up a general and optimal solution for the problems. Follow-up in-depth questions were minimal and not hard.
The last coding question was a pure algorithm question related to search trees/tries. No coding required, spent the whole time reasoning about the most effective algorithm. This was a bit of a brain twister.
The design question was related to high-level system design (not OO design) for storage and search in geographic data. Focus was effective search as well as scalability both in traffic and data volumes.
Tips: Read "Cracking the coding interview" or other similar literature. Solve all the problems and you should be good to go. If you solve a bunch of problems at HackerRank (or similar) as well, you'll have the added bonus of training on how to generalize the algorithms.
SAP Interview FAQs
Tell us how to improve this page.
SAP Interviews By Designations
- SAP Software Developer Interview Questions
- SAP Developer Associate Interview Questions
- SAP Developer Interview Questions
- SAP Associate Software Developer Interview Questions
- SAP Senior Developer Interview Questions
- SAP Software Engineer Interview Questions
- SAP Scholar@sap Interview Questions
- SAP Devops Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Development Engineer Interview Questions
- Software Developer Interview Questions
- Junior Software Developer Interview Questions
- Show more
SAP Software Developer Intern Interview Process
based on 1 interview
1 Interview rounds
- Coding Test Round
Software Developer Intern Interview Questions from Similar Companies
Fast track your campus placements
SAP Software Developer Intern Reviews and Ratings
based on 3 reviews
Rating in categories
|
Software Developer
1.1k
salaries
|  ₹8 L/yr - ₹32 L/yr |
|
Developer
893
salaries
| ₹10.3 L/yr - ₹34 L/yr |
|
Developer Associate
841
salaries
| ₹7.5 L/yr - ₹20.3 L/yr |
|
Senior Developer
571
salaries
| ₹13 L/yr - ₹51 L/yr |
|
Business Process Consultant
435
salaries
| ₹10 L/yr - ₹40 L/yr |
Oracle
SAS
Zoho
IBM
- Home >
- Interviews >
- SAP Interview Questions >
- SAP Software Developer Intern Interview Questions
