SAP Developer Associate Interview Questions, Process, and Tips

Round duration - 60 mins
Round difficulty - Easy

The first round was coding + mcq round. It was held in the campus in the afternoon. There were 10 mcqs based on the computer related subjects and 2 coding questions with around 10 test cases to be completed within 60 minutes. The questions were random for every person. 

Q1. 
Inorder Successor in a Binary Tree
Given a node in an arbitrary binary tree, find its inorder successor. The successor is defined as the node that appears immediately after the given node in the in-order ...read more
Ans. 
Given a node in a binary tree, find its inorder successor in the tree.
• Traverse the tree in in-order fashion to find the successor node.

• If the given node has a right child, the successor will be the leftmost node in the right subtree.

• If the given node does not have a right child, backtrack to the parent nodes to find the successor.

• Handle the case where the given node is the last node in the in-order traversal.

• Return the...read more
Answered by AI
Add your answer
Q2. 
Uncommon Characters Problem Statement
Given two strings str1 and str2 containing only lowercase alphabets, find the characters that are unique to each string, i.e., characters that occur in only one of th...read more
Ans. 
Find uncommon characters in two strings and return them in lexicographically sorted 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 array.

• Sort the result array in lexicographical order and return it.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

I got selected for the interview. It was held 2 days after the coding round. First all the shortlisted students attended the company ppt. After that we went for the first interview. The interviewer was very friendly. He mainly asked about DBMS concepts and some coding questions.

Q1. 
Reverse a Linked List Iteratively
You are given a singly linked list of integers. The task is to return the head of the reversed linked list.
Example:
Input:
The given linked list is 1 -> 2 -> 3 ...read more
Ans. 
Reverse a singly linked list iteratively and return the head of the reversed linked list.
• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Keep track of the previous, current, and next nodes while traversing the linked list.

• Update the head of the reversed linked list to be the last node encountered.

• Time complexity: O(N), Space complexity: O(1).
Answered by AI
Add your answer

Round duration - 40 mins
Round difficulty - Hard

Soon, after the first interview, I got shortlisted for the second interview. I went to the interviewer. At first, he just asked me about my hobbies.Subsequently, he took a look at my CV and asked me to explain the projects on which I had worked on in my internship. After that, he asked about whether I know Java on which I said no. Then he asked me some concepts of OOPS and a problem on inheritance and classes.

Round duration - 15 mins
Round difficulty - Easy

After an hour of the second interview, I was called for the managerial round. The manager first asked me to introduce myself and then he just asked me my job location preference whether it is bangalore or gurgaon. He then asked are you satisfied with the pay we are offering. At the end, he asked me what approach can we use to count hair on our head.