AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
SAP
Compare
Filter interviews by
SAP Software Developer Interview Questions and Answers for Freshers
29 Interview questions
Reverses every k nodes in a linked list
Iterate through the linked list in groups of k nodes
Reverse each group of k nodes
Connect the reversed groups back together
Find the maximum area rectangle of 1s in a binary matrix.
Iterate through each row of the matrix and calculate the maximum area of rectangle with that row as the base.
Use a stack to keep track of the indices of the rows with increasing heights.
For each row, calculate the area of rectangle with that row as the height and update the maximum area.
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
Inheritance allows for code reuse and promotes modularity.
The class that is being inherited from is called the superclass or base class.
The class that inherits from the superclass is called the subclass or derived class.
The subclass can access the public and protected members of the superclass...
Polymorphism is the ability of an object to take on many forms. It allows objects of different classes to be treated as the same type.
Polymorphism allows a single interface to be used for different types of objects.
It enables code reusability and flexibility in object-oriented programming.
For example, a parent class 'Animal' can have multiple child classes like 'Dog', 'Cat', and 'Bird'. They can all be treated as ...
Regular expressions in PHP are powerful tools for pattern matching and manipulating strings.
Regular expressions are defined using the preg_match() function in PHP.
They are used to search, replace, and validate strings based on specific patterns.
Regex patterns consist of a combination of characters and special symbols.
Modifiers can be added to the pattern to control the matching behavior.
Common regex functions in P...
Print Permutations - String Problem Statement
Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.
Input:
The first and only line of input c...
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.
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 credi...
Remove Consecutive Duplicates Problem Statement
Given a string S, your task is to recursively remove all consecutive duplicate characters from the string.
Input:
String S
Output:
Output string
Constra...
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'
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 tabl...
Overlapping Intervals Problem Statement
You are given the start and end times of 'N' intervals. Write a function to determine if any two intervals overlap.
Note:
If an interval ends at time T and another...
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
SAP Software Developer Interview Experiences for Freshers
7 interviews found
Anonymous
I applied via Campus Placement and was interviewed in Nov 2023. There were 2 interview rounds.
2 problems, 60 minutes. You have to pass both to get interview.
(3 Questions)
- Q1. Leetcode medium-hard
- Q2. Maximum area rectangle of 1s in a binary matrix
- Ans.
Find the maximum area rectangle of 1s in a binary matrix.
Iterate through each row of the matrix and calculate the maximum area of rectangle with that row as the base.
Use a stack to keep track of the indices of the rows with increasing heights.
For each row, calculate the area of rectangle with that row as the height and update the maximum area.
- Q3. K-reverse a linked list
- Ans.
Reverses every k nodes in a linked list
Iterate through the linked list in groups of k nodes
Reverse each group of k nodes
Connect the reversed groups back together
Skills evaluated in this interview
I applied via Walk-in and was interviewed in Aug 2022. There were 3 interview rounds.
Verbal ability, reasoning ability,quantitative ability
(1 Question)
- Q1. Introduce myself , java basic questions
Interview Preparation Tips
I appeared for an interview in Dec 2020.
(1 Question)
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.
- Q1.
Longest Unique Substring Problem Statement
Given a string input of length 'n', your task is to determine the length of the longest substring that contains no repeating characters.
Explanation:
A substri...
- Ans.
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.
(1 Question)
Round duration - 30-40 minutes
Round difficulty - Medium
- Q1.
Duplicate Integer in Array
Given an array
ARRof sizeN, containing each number between 1 andN-1at least once, identify the single integer that appears twice.Input:
The first line contains an integer... - Ans.
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.
(1 Question)
Round duration - 30 - 40 minutes
Round difficulty - Medium
- Q1.
Binary Pattern Problem Statement
Given an input integer
N, your task is to print a binary pattern as follows:Example:
Input:
N = 4
Output:
1111
000
11
0Explanation:
The first line contains 'N' 1s. T...
- Ans.
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
Interview Preparation Tips
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.
Skills evaluated in this interview
I appeared for an interview before May 2021.
(3 Questions)
Round duration - 90 minutes
Round difficulty - Medium
- Q1.
Longest Increasing Subsequence Problem Statement
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...
- Ans.
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.
- Q2.
Overlapping Intervals Problem Statement
You are given the start and end times of 'N' intervals. Write a function to determine if any two intervals overlap.
Note:
If an interval ends at time T and anothe...
- Ans.
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
- Q3. What SQL queries were asked during your interview?
- Ans.
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...
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
- Q1.
Zig-Zag String Problem Statement
Given a string
STRof sizeNand an integerMrepresenting the number of rows in the zig-zag pattern, return the string formed by concatenating all rows when the stringST... - Ans.
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
- Q2.
Next Permutation Problem Statement
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 ...
- Ans.
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.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
- Q1.
Remove Consecutive Duplicates Problem Statement
Given a string S, your task is to recursively remove all consecutive duplicate characters from the string.
Input:
String S
Output:
Output string
Constr...
- Ans.
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'
- Q2.
Print Permutations - String Problem Statement
Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.
Input:
The first and only line of input ...
- Ans.
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.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Medium
- Q1. Design an e-commerce website similar to Flipkart or Amazon.
- Ans.
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...
Interview Preparation Tips
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
Skills evaluated in this interview
I appeared for an interview in Oct 2016.
Interview Questionnaire
5 Questions
- Q1. What is inheritance?
- Ans.
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
Inheritance allows for code reuse and promotes modularity.
The class that is being inherited from is called the superclass or base class.
The class that inherits from the superclass is called the subclass or derived class.
The subclass can access the public and protected members of the superclass.
Inhe...
- Q2. Regular expressions in PhP
- Ans.
Regular expressions in PHP are powerful tools for pattern matching and manipulating strings.
Regular expressions are defined using the preg_match() function in PHP.
They are used to search, replace, and validate strings based on specific patterns.
Regex patterns consist of a combination of characters and special symbols.
Modifiers can be added to the pattern to control the matching behavior.
Common regex functions in PHP in...
- Q3. What is polymorphism? Explain using a real life example
- Ans.
Polymorphism is the ability of an object to take on many forms. It allows objects of different classes to be treated as the same type.
Polymorphism allows a single interface to be used for different types of objects.
It enables code reusability and flexibility in object-oriented programming.
For example, a parent class 'Animal' can have multiple child classes like 'Dog', 'Cat', and 'Bird'. They can all be treated as 'Anim...
- Q4. Discussion about projects.
- Q5. Aggregate functions in dbms? And query questions related to that.
Interview Preparation Tips
Experience: 10 questions of aptitude containing English paragraph solving , Maths aptitude and also logical reasoning. Other 3 questions were of programming in any language comfortable.Two of the questions were partially done.In one of them only the logic was to be coded and in the other the error was to be corrected to give the correct output.
Duration: 1 hour 20 minutes
Total Questions: 13
Round: Technical Interview
Experience: They test your basic knowledge of programming, databases and how well you have worked with your projects.
There are actually three more rounds. 2 technical and one HR. I was not selected for them. Out of 40 students only 5 were selected after the final round.
Skills: Basic C/C++, DBMS, Multiple And Multi-level Inheritance, Polymorphism, PHP, Regular Expressions
College Name: Thapar University, Patiala
Skills evaluated in this interview
I appeared for an interview before Dec 2020.
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was a technical interview round which lasted for 60 minutes. Questions based on DSA, OS and DBMS were discussed.
- Q1.
Factorial of a Number Problem Statement
You are provided with an integer 'N'. Your task is to calculate and print the factorial of 'N'. The factorial of a number 'N', denoted as N!, is the product of all ...
- Ans.
Calculate and print the factorial of a given integer 'N'.
Iterate from 1 to N and multiply each number to calculate factorial
Handle edge cases like N=0 or N=1 separately
Use recursion to calculate factorial efficiently
- Q2.
Covid Vaccination Distribution Problem
As the Government ramps up vaccination drives to combat the second wave of Covid-19, you are tasked with helping plan an effective vaccination schedule. Your goal is...
- Ans.
Maximize the number of vaccines administered on a specific day while adhering to certain rules.
Given n days, maxVaccines available, and a specific dayNumber, distribute vaccines to maximize on dayNumber
Administer positive number of vaccines each day with a difference of 1 between consecutive days
Ensure sum of vaccines distributed does not exceed maxVaccines
Output the maximum number of vaccines administered on dayNumber...
- Q3. What is a semaphore?
- Ans.
A semaphore is a synchronization construct used to control access to a shared resource by multiple processes or threads.
Semaphores can have an integer value representing the number of available resources.
They can be used to implement mutual exclusion and synchronization between processes.
Examples include binary semaphores (mutexes) and counting semaphores.
Operations on semaphores include wait (P) and signal (V).
- Q4. What is the difference between RDBMS and DBMS?
- Ans.
RDBMS is a type of DBMS that manages data in a structured format using tables with relationships.
RDBMS enforces referential integrity through foreign keys, while DBMS does not.
RDBMS supports ACID properties (Atomicity, Consistency, Isolation, Durability), while DBMS may not.
RDBMS allows for normalization of data to reduce redundancy, while DBMS does not have this feature.
Examples of RDBMS include MySQL, Oracle, SQL Ser...
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
A 60 minute technical round to test programming concepts. Questions on DBMS, OOPS, OS were also discussed.
- Q1.
Bubble Sort Problem Statement
Sort the given unsorted array consisting of N non-negative integers in non-decreasing order using the Bubble Sort algorithm.
Input:
The first line contains an integer 'T' r...
- Ans.
Bubble Sort algorithm is used to sort an array of non-negative integers in non-decreasing order.
Iterate through the array and compare adjacent elements, swapping them if they are in the wrong order.
Repeat this process until the array is sorted.
Time complexity of Bubble Sort is O(n^2) in worst case.
Space complexity of Bubble Sort is O(1) as it is an in-place sorting algorithm.
- Q2.
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]
- Q3. What is normalization in the context of database management systems?
- Ans.
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.
Normalization involves breaking down a database into smaller, more manageable tables.
It helps in reducing data redundancy by storing data in a structured way.
There are different normal forms such as 1NF, 2NF, 3NF, BCNF, etc., each with specific rules to follow.
Normalization ensures data integrity and reduces th...
Round duration - 40 minutes
Round difficulty - Easy
This was a HR round. The interviewer asked me a number of questions about myself and gave a puzzle as well to solve.
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
I appeared for an interview before Jan 2021.
(1 Question)
Round duration - 100 minutes
Round difficulty - Easy
Sections in test :
1 Psychometric Test
2. Analytical Aptitude
3 Logical Reasoning
4 Two coding Questions
5.Pattern Recognition
6.Essay writing
Tips :
1. Do the coding Question first ,they are mot important ,if your code doesn't run you are disqualified.
2. Practice on leetcode.
3. Sectional Cutoff
- Q1.
Level Order Traversal Problem Statement
Given a binary tree of integers, return the level order traversal of the binary tree.
Input:
The first line contains an integer 'T', representing the number of te... - Ans.
The task is to implement a function that returns the level order traversal of a binary tree given in level order.
Create a queue to store nodes for level order traversal
Start with the root node and enqueue it
While the queue is not empty, dequeue a node, print its value, and enqueue its children
Repeat until all nodes are traversed
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round where the interviewer asked me questions on data structures, database management system, SQL queries, cloud computing concepts and puzzles. We also had a discussion on our projects.
- Q1.
Floyd Warshall Algorithm Problem
You are given a directed weighted graph with 'N' vertices, labeled from 1 to 'N', and 'M' edges. Each edge connects two nodes 'u' and 'v' with a weight 'w', representing t...
- Ans.
The Floyd Warshall algorithm is used to find the shortest paths between all pairs of vertices in a graph, including graphs with negative edge weights.
The algorithm works by considering all pairs of vertices and all intermediate vertices to find the shortest path.
It can handle graphs with negative edge weights, but not negative weight cycles.
The time complexity of the algorithm is O(N^3), where N is the number of vertic...
- Q2. What would be the database design for an ATM system?
- Ans.
The database design for an ATM system should include tables for users, accounts, transactions, and ATM machines.
Create a table for users with fields like user_id, name, pin, etc.
Create a table for accounts with fields like account_id, user_id, balance, etc.
Create a table for transactions with fields like transaction_id, account_id, amount, date, etc.
Create a table for ATM machines with fields like atm_id, location, sta...
- Q3. What is the difference between public and private cloud?
- Ans.
Public cloud is shared infrastructure available to anyone, while private cloud is dedicated infrastructure for a single organization.
Public cloud is accessible to multiple organizations or users, while private cloud is exclusive to a single organization.
Public cloud services are provided over the internet, while private cloud services can be hosted on-premises or in a dedicated data center.
Public cloud offers cost-effe...
(5 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round that lasted for 60 minutes. Questions on data structures, DBMS, OS and puzzles were discussed.
- Q1.
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege... - Ans.
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
- Q2. What is the difference between a primary key and a unique key in a database management system?
- Ans.
Primary key uniquely identifies each record in a table, while unique key ensures that all values in a column are distinct.
Primary key does not allow NULL values, while unique key allows one NULL value.
A table can have only one primary key, but multiple unique keys.
Primary key is automatically indexed, while unique key may or may not be indexed.
Example: In a table of students, student ID can be a primary key as it uniqu...
- Q3. Write a query to find the nth highest salary in a database.
- Ans.
Query to find the nth highest salary in a database
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT clause to specify the nth highest salary
Consider handling cases where there may be ties for the nth highest salary
- Q4. What is the difference between AES and DES ciphers?
- Ans.
AES is a more secure and efficient cipher compared to DES.
AES has a block size of 128 bits, while DES has a block size of 64 bits.
AES supports key sizes of 128, 192, or 256 bits, while DES supports only 56-bit keys.
AES is considered more secure and efficient than DES due to its stronger encryption algorithm and larger key sizes.
- Q5. You have a torch and a bridge that can only hold two people at a time. Four people need to cross the bridge at night, and they have only one torch. Each person walks at a different speed. When two people c...
Round duration - 30 minutes
Round difficulty - Easy
The lady was tough and showed her intent in the PPT as well. She asked a number of questions to know more about me.
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
Top trending discussions
Interview questions from similar companies
Interview Preparation Tips
Experience: Approx. 30.questions in 50 min
Tips: Try solving each que in less than a minute ,don't waste time on difficult questions, complete easier once first
Duration: 50 minutes
Total Questions: 30
College Name: Pimpri chinchwad college of engineering
Interview Preparation Tips
College Name: NIT SURATHKAL
Interview Preparation Tips
Experience: Oracle had an online test which includes 3
Sections:
1. Programming: basic C++/java programming + data structure. One need to have good hand over oops
to score well in this section.
2. Aptitude: General Aptitude Questions
3. General Maths: Very simple maths problem (+2 level) but needs very very good speed.
Tips: Individual cutoff was not declared, but different cutoff for different profile is expected.
Oracle has no GD round.
Round: Interview
Experience: In 2nd round of interview, there was more programming, less resume based question and more emphasis on will I be comfortable in an IT sector. Some apti questions were also asked.
Round: Interview
Experience: 1st round was completely on resume based. Each and every project and intern is discussed in detail. Most of the extracurricular activities were also discussed. In the 1st interview, some basic program like fibonacci series by recursion, star pattern by loop etc were asked.
Round: Interview
Experience: Next round was HR. I was asked about the earlier 2 interviews and some basic HR questions.
College Name: IIT Roorkee
SAP Interview FAQs
The duration of SAP Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
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
- Java Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 1 interview experience
Difficulty level
Duration
Software Developer Interview Questions from Similar Companies
SAP Software Developer Reviews and Ratings
based on 198 reviews
Rating in categories
|
Software Developer
1.3k
salaries
|  ₹13.7 L/yr - ₹27 L/yr |
|
Developer Associate
990
salaries
| ₹6.7 L/yr - ₹23.7 L/yr |
|
Developer
898
salaries
| ₹10.3 L/yr - ₹34 L/yr |
|
Senior Developer
581
salaries
| ₹14 L/yr - ₹51 L/yr |
|
Business Process Consultant
490
salaries
| ₹12.9 L/yr - ₹39.3 L/yr |
Oracle
SAS
Zoho
IBM
- Home >
- Interviews >
- SAP Interview Questions >
- SAP Interview Questions for Fresher
