i
SAP
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Walk-in and was interviewed in Aug 2022. There were 3 interview rounds.
Verbal ability, reasoning ability,quantitative ability
I applied via Campus Placement and was interviewed in Jul 2021. There were 4 interview rounds.
I was interviewed in Jan 2021.
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).
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...
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.
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Given two arrays:
AT
- represent...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.
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.
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.
The Merge Sort...
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]
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.
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.
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.
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...
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.
Create a base class called Shape
that contains a field named shapeType
and a method printMyType
.
Implement two derived classes:
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 ...
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...
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.
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
What people are saying about SAP
I was interviewed in Dec 2020.
Round duration - 60 minutes
Round difficulty - Medium
It consisted of 10 MCQ questions based on OOPs(C++ and Java-based), C(based on pointers), and 2 coding questions.
Given a string input of length 'n', your task is to determine the length of the longest substring that contains no repeating characters.
A substri...
Find the length of the longest substring with unique characters in a given string.
Use a sliding window approach to keep track of the longest substring without repeating characters.
Use a hashmap to store the index of each character in the string.
Update the start index of the window when a repeating character is encountered.
Calculate the maximum length of the window as you iterate through the string.
Round duration - 30-40 minutes
Round difficulty - Medium
Given an array ARR
of size N
, containing each number between 1 and N-1
at least once, identify the single integer that appears twice.
The first line contains an integer...
Identify the duplicate integer in an array containing numbers between 1 and N-1.
Iterate through the array and keep track of the frequency of each element using a hashmap.
Return the element with a frequency greater than 1 as the duplicate integer.
Time complexity can be optimized to O(N) using Floyd's Tortoise and Hare algorithm.
Example: For input [1, 2, 3, 4, 4], the output should be 4.
Round duration - 30 - 40 minutes
Round difficulty - Medium
Given an input integer N
, your task is to print a binary pattern as follows:
N = 4
1111
000
11
0
The first line contains 'N' 1s. T...
Print a binary pattern based on input integer N in a specific format.
Iterate from 1 to N and print N - i + 1 numbers alternatively as 1 or 0 in each line
Follow the pattern of increasing 1s and decreasing 0s in each line
Handle the number of test cases and constraints as specified
Round duration - 15 minutes
Round difficulty - Easy
Tip 1 : Be confident while talking to the interviewer, if you don't know the answer then simply say you are not aware with this topic.
Tip 2 : Be interactive with interviewer, feel free to ask question(if any).
Tip 3 : Be honest, you have already solved some problems, if interviewer ask you whether you have solved this problem earlier or not then be honest while answering it.
Tip 1 : Mention the latest project in resume.
Tip 2 : Don't put too many things in your resume, Be concise and precise with your resume.
SAP interview questions for popular designations
I applied via Campus Placement and was interviewed in Dec 2021. There were 6 interview rounds.
Zsd015
Zbid001
Zbid002
Get interview-ready with Top SAP Interview Questions
My family background is diverse and has influenced my personal and professional growth.
My parents come from different cultural backgrounds, which has exposed me to different perspectives and values.
Growing up, I learned the importance of hard work and determination from my father, who started his own successful business.
My mother's background in finance has sparked my interest in business and entrepreneurship.
I have a ...
As a Business Development Manager, my responsibility is to identify and create new business opportunities, build and maintain relationships with clients, and develop strategies to drive growth and profitability.
Identifying and creating new business opportunities
Building and maintaining relationships with clients
Developing strategies to drive growth and profitability
Conducting market research and analysis
Collaborating w...
I have successfully developed and implemented business strategies to drive growth and increase revenue.
Led cross-functional teams to identify new business opportunities
Developed and maintained relationships with key stakeholders
Analyzed market trends and competitor activity to inform strategic decisions
SAP stands for Systems, Applications, and Products in Data Processing. It is an ERP software used for managing business operations.
SAP is an enterprise resource planning software used for managing business operations.
It integrates various business functions like finance, sales, production, and inventory management.
SAP helps in streamlining business processes, improving efficiency, and reducing costs.
It provides real-ti...
I was interviewed before May 2021.
Round duration - 90 minutes
Round difficulty - Medium
Given 'N' students standing in a row with specific heights, your task is to find the length of the longest strictly increasing subsequence of their heights...
Find the length of the longest strictly increasing subsequence of heights of students in a row.
Iterate through the heights array and for each element, find the length of the longest increasing subsequence ending at that element.
Use dynamic programming to keep track of the longest increasing subsequence length for each element.
Return the maximum length found as the result.
You are given the start and end times of 'N' intervals. Write a function to determine if any two intervals overlap.
If an interval ends at time T and anothe...
Given start and end times of intervals, determine if any two intervals overlap.
Iterate through intervals and check if any two intervals overlap by comparing their start and end times
Sort intervals based on start times for efficient comparison
Consider edge cases where intervals end and start at the same time
Various SQL queries related to data manipulation and retrieval were asked during the interview.
Basic SELECT queries to retrieve data from a single table
JOIN queries to retrieve data from multiple tables based on a common column
Aggregate functions like COUNT, SUM, AVG, etc. to perform calculations on data
Subqueries to retrieve data based on the result of another query
UPDATE queries to modify existing data in a table
DELE...
Round duration - 60 Minutes
Round difficulty - Medium
Given a string STR
of size N
and an integer M
representing the number of rows in the zig-zag pattern, return the string formed by concatenating all rows when the string ST...
Arrange a string in zig-zag pattern with given number of rows and concatenate the rows.
Iterate through the string and distribute characters to rows based on zig-zag pattern
Concatenate the characters in each row to get the final result
Handle edge cases like when number of rows is 1 or equal to the length of the string
You are given a permutation of 'N' integers. A sequence of 'N' integers is considered a permutation if it includes all integers from 1 to 'N' exactly once. Your task is ...
The task is to rearrange a given permutation of 'N' integers to form the lexicographically next greater permutation.
Iterate from right to left to find the first element that is smaller than the element to its right.
Swap this element with the smallest element to its right that is greater than it.
Reverse the elements to the right of the swapped element to get the lexicographically next greater permutation.
Round duration - 60 Minutes
Round difficulty - Medium
Given a string S, your task is to recursively remove all consecutive duplicate characters from the string.
String S
Output string
Recursively remove consecutive duplicate characters from a string.
Use recursion to check if the current character is the same as the next character, if so skip the next character
Base case: if the string is empty or has only one character, return the string
Example: Input: 'aaabcc', Output: 'abc'
Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.
The first and only line of input ...
Return all possible permutations of a given input string.
Use recursion to generate all possible permutations of the input string.
Swap characters at different positions to generate permutations.
Handle duplicate characters in the input string by using a set to store unique permutations.
Round duration - 60 Minutes
Round difficulty - Medium
Design an e-commerce website similar to Flipkart or Amazon.
Implement user-friendly interface for easy navigation
Include search functionality with filters for products
Incorporate secure payment gateway for transactions
Provide personalized recommendations based on user behavior
Include customer reviews and ratings for products
Implement order tracking and delivery status updates
Offer various payment options like credit/deb
Tip 1 : Prepare DSA well. Standard Leetcode-type questions will be asked.
Tip 2 : You should be crystal clear about your project/s as any question would be asked and you should be able to answer it.
Tip 3 : Prepare CS fundaments like OS, OOPs, DBMS, etc.
Tip 1 : Clearly mention the tech. stack you have worked on in the project/s
Tip 2 : As a fresher, you should add your coding profiles on CodeChef, Codeforces, etc. so as to make the resume shortlisting easy
I was interviewed 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.
I applied via Referral and was interviewed before May 2021. There were 2 interview rounds.
Easy leetcode problem, hashmap
The duration of SAP interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 18 interviews
Interview experience
Bangalore / Bengaluru
3-10 Yrs
Not Disclosed
Software Developer
1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Developer
865
salaries
| ₹0 L/yr - ₹0 L/yr |
Developer Associate
826
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Developer
493
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Process Consultant
422
salaries
| ₹0 L/yr - ₹0 L/yr |
Oracle
SAS
Zoho
IBM