i
SAP
Filter interviews by
I appeared for an interview before Sep 2020.
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.
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 ...
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...
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...
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.
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.
You are given a singly linked list of integers. The task is to return the head of the reversed linked list.
The given linked list is 1 -> 2 -> 3 ...
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).
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.
Tip 1 : Always tell what you are thinking to the interviewer, don’t be silent, be confident. Interviewer is more concerned with how you approach a question rather than just getting the solution.
Tip 2 : Practice, practice and Practice. You have to code regularly. You won't remember the approach of a question if you just mentally solve it and don't code. Practicing will also enhance your speed on the day of the test.
Tip 3 : Just focus on your preparation. Don't bother yourselves by what others are doing. People may try to mislead you by concealing about their preparation.
Tip 1: Try to adjust it to one page. Don't include unnecessary details.
Tip 2: Try to use good templates present on the internet. My interviewer was quite impressed with my template.
Top trending discussions
I applied via Campus Placement and was interviewed before Dec 2021. There were 4 interview rounds.
Quantitative, Reasoning, DBMS Concepts, Flow chart questions
Merge sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting each half, and then merging them.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Time complexity is O(n log n)
Space complexity is O(n)
To check if there is a loop in a linked list, we can use Floyd's cycle-finding algorithm.
Create two pointers, slow and fast, and initialize them to the head of the linked list.
Move slow pointer by one node and fast pointer by two nodes.
If there is a loop, the fast pointer will eventually catch up to the slow pointer.
If there is no loop, the fast pointer will reach the end of the linked list.
Time complexity: O(n), Space...
posted on 8 Jan 2021
I applied via Company Website and was interviewed before Oct 2019. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Mar 2020. There were 4 interview rounds.
Web service flow is the sequence of steps involved in the communication between a client and a server over the internet.
Web service flow involves a client sending a request to a server
The server processes the request and sends a response back to the client
The response can be in various formats such as XML, JSON, or plain text
Web service flow can be synchronous or asynchronous
Examples of web services include RESTful API...
To check ports in Solaris or Linux machine, use the netstat command.
Open the terminal and type 'netstat -an' to display all open ports.
Use 'netstat -an | grep
To check listening ports, use 'netstat -an | grep LISTEN'.
For Solaris, use 'netstat -an | grep .
I applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.
Numerical and logical aptitude test
There are 5 rounds on datastructure and algorithm
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 50 minutes
Round difficulty - Easy
This was a Data Structural round.
Given a two-dimensional array/list consisting of integers 0s and 1s, where 1 represents land and 0 represents water, determine the number of distinct islands. A group of...
Count the number of distinct islands in a 2D array of 0s and 1s.
Identify islands by performing depth-first search (DFS) on the grid
Use a set to store the shape of each island and check for duplicates
Consider translations to determine distinct islands
Round duration - 50 minutes
Round difficulty - Easy
This was a Data Structural round.
You are tasked with arranging 'N' words of varying lengths such that each line contains at most 'M' characters, with each word separated by a space. The challenge is to minimiz...
The goal is to minimize the total cost of arranging 'N' words on each line with a maximum character limit 'M'.
Calculate the cost of each line as the cube of extra space characters needed to reach 'M'.
Minimize the total cost by arranging words to fit within the character limit on each line.
Ensure each word appears fully on one line without breaking across lines.
Round duration - 60 minutes
Round difficulty - Easy
This was a System Design round.
Design a system similar to Red Bus for handling bookings and onboarding vendors and customers.
Implement a user-friendly interface for customers to search and book tickets
Create a vendor portal for vendors to manage their offerings and availability
Include payment gateway integration for secure transactions
Develop a robust backend system for managing bookings, cancellations, and refunds
Utilize a database to store user in...
Round duration - 50 minutes
Round difficulty - Easy
This was a System Design round
Round duration - 50 minutes
Round difficulty - Easy
This was an HR round.
Tip 1 : Practice as much as you can.
Tip 2 : Prepare for company, not in general.
Tip 3 : Your past work should be objective and your contribution should be very clear
Tip 1 : Keep only relevant things for the job you are applying.
Tip 2 : Minimal data with measurable contribution and effect.
I applied via Monster and was interviewed before Apr 2020. There was 1 interview round.
Some of the top questions asked at the SAP Developer Associate interview for freshers -
The duration of SAP Developer Associate interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 115 reviews
Rating in categories
Software Developer
1.3k
salaries
| ₹13.7 L/yr - ₹28.5 L/yr |
Developer Associate
1k
salaries
| ₹10.8 L/yr - ₹18.5 L/yr |
Developer
900
salaries
| ₹15.9 L/yr - ₹28 L/yr |
Senior Developer
580
salaries
| ₹25.5 L/yr - ₹45 L/yr |
Business Process Consultant
493
salaries
| ₹16.9 L/yr - ₹35 L/yr |
Oracle
SAS
Zoho
IBM