i
SAP
Filter interviews by
Design a parking lot system with features like parking, retrieving, and displaying available spots.
Create a class for ParkingLot with attributes like total spots, available spots, and a list of parked vehicles.
Implement methods for parking a vehicle, retrieving a vehicle, and displaying available spots.
Consider using data structures like arrays or lists to manage parked vehicles and available spots.
To remove a node in a linked list, update the previous node's next pointer to skip the node to be removed.
Traverse the linked list to find the node to be removed
Update the previous node's next pointer to skip the node to be removed
Free the memory allocated to the node to be removed
Reversing a linked list involves changing the direction of the pointers between nodes.
Iterative approach: Use three pointers (prev, current, next) to reverse the links.
Example: For list 1 -> 2 -> 3, after reversal it becomes 3 -> 2 -> 1.
Recursive approach: Reverse the rest of the list and adjust pointers accordingly.
Example: Base case when current is null, then set head to prev.
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the 0...
BFS traversal in a disconnected graph starting from vertex 0.
Implement BFS algorithm to traverse the graph starting from vertex 0.
Explore neighbor nodes first before moving to the next level neighbors.
Consider the bidirectional nature of edges in an undirected graph.
Output the BFS traversal sequence for each test case in a separate line.
Given a positive integer N
, your task is to identify all prime numbers less than or equal to N
.
A prime number is a natural number greater than 1 that has no pos...
Identify all prime numbers less than or equal to a given positive integer N.
Iterate from 2 to N and check if each number is prime
Use the Sieve of Eratosthenes algorithm for efficient prime number identification
Optimize by only checking up to the square root of N for divisors
BCNF is a normal form in database management systems that ensures all determinants are candidate keys.
BCNF stands for Boyce-Codd Normal Form.
It is a stricter version of 3NF (Third Normal Form).
In BCNF, every determinant must be a candidate key.
It helps in reducing redundancy and anomalies in the database.
Example: If a table has columns A, B, and C, and A determines B and B determines C, then it is not in BCNF unle...
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"ed...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from the end to the beginning and append each character to a new string.
Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.
Handle special characters and numbers while reversing the string.
Ensure to consider the constraints provided in the problem statem...
Yes, I can design an ER diagram for an online shopping portal.
Entities: User, Product, Order, Payment, Cart
Relationships: User places Order, Order contains Product, Payment for Order, User has Cart
Attributes: User (id, name, email), Product (id, name, price), Order (id, date), Payment (id, amount)
Given a binary tree of integers, your task is to output the right view of the tree.
The right view of a binary tree includes the nodes that are visible when the tree is observed ...
The task is to output the right view of a binary tree, which includes the nodes visible when observed from the right.
Traverse the tree level by level and keep track of the rightmost node at each level.
Use a queue for level order traversal and a map to store the rightmost nodes.
Print the values of the rightmost nodes stored in the map as the right view of the tree.
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 uses structures for data organization, while C++ uses classes.
C does not have features like inheritan...
I appeared for an interview before May 2024, where I was asked the following questions.
I applied via Referral and was interviewed before Jul 2023. There was 1 interview round.
1 hour coding test on hackerrank, 2 questions to be solved in 45 mins , questions were mostly based on Data structures
I applied via LinkedIn and was interviewed before Mar 2023. There were 2 interview rounds.
Find the cousins in binary tree
Design a parking lot system with features like parking, retrieving, and displaying available spots.
Create a class for ParkingLot with attributes like total spots, available spots, and a list of parked vehicles.
Implement methods for parking a vehicle, retrieving a vehicle, and displaying available spots.
Consider using data structures like arrays or lists to manage parked vehicles and available spots.
I appeared for an interview in Apr 2021.
Round duration - 30 minutes
Round difficulty - Easy
The round was an online assessment in which there were 2coding questions and the rest were the basic questions of c, c++ concept and surely it was an easy round and I would suggest you all kindly attempt those coding questions
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node.
Keep track of the current, previous, and next nodes while reversing the linked list.
Update the head of the reversed linked list as the last node encountered during reversal.
Round duration - 30 minutes
Round difficulty - Medium
It was the complete coding round based upon the Resume.
Create a series of classes to demonstrate multilevel inheritance.
Create three classes to illustrate multilevel inheritance.
GrandFather
: This clas...Demonstrate multilevel inheritance with classes GrandFather, Father, and Son with specific attributes and methods.
Create a class GrandFather with a parameterized constructor and attribute grandFatherName.
Create a class Father inheriting from GrandFather with an additional attribute fatherName.
Create a class Son inheriting from Father with an additional attribute sonName and a method printName to display all names in a ...
Round duration - 30 minutes
Round difficulty - Easy
This was totally based upon you, they judge your confidence, Why SAP, What is SAP, and so on. Why are you choosing SAP WILP rather than doing a normal MCA or MTech degree? Remember they will going to tell you that it’s very hard and all but you have to stick over your words and should show up all your confidence.
Tip 1 : stick to the basics
Tip 2 : practise coding questions as much as you can
Tip 3 : prepare aptitude
Tip 1 : keep resume short
Tip 2 : Add at least 2 good projects
I appeared for an interview before Oct 2022.
Reversing a linked list involves changing the direction of the pointers between nodes.
Iterative approach: Use three pointers (prev, current, next) to reverse the links.
Example: For list 1 -> 2 -> 3, after reversal it becomes 3 -> 2 -> 1.
Recursive approach: Reverse the rest of the list and adjust pointers accordingly.
Example: Base case when current is null, then set head to prev.
To remove a node in a linked list, update the previous node's next pointer to skip the node to be removed.
Traverse the linked list to find the node to be removed
Update the previous node's next pointer to skip the node to be removed
Free the memory allocated to the node to be removed
Core java question and deep discussion
I appeared for an interview before Dec 2020.
Round duration - 90 minutes
Round difficulty - Easy
Online test had 6 parts-psychometric test, aptitude, logical, English, computer skills and 2 coding questions. Time given to us was 90 minutes. Paper was quite lengthy and of average difficulty level. I was able to complete all the sections, but only one coding question.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from the end to the beginning and append each character to a new string.
Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.
Handle special characters and numbers while reversing the string.
Ensure to consider the constraints provided in the problem statement.
T...
Round duration - 60 minutes
Round difficulty - Medium
Firstly the interviewer asked me to introduce myself after he introduced himself. Since i went there as experienced guy he asked me about my workings in the current company. After that,he asked some programming questions, tested my concepts of DBMS and OOPS, and some puzzles.
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal in a disconnected graph starting from vertex 0.
Implement BFS algorithm to traverse the graph starting from vertex 0.
Explore neighbor nodes first before moving to the next level neighbors.
Consider the bidirectional nature of edges in an undirected graph.
Output the BFS traversal sequence for each test case in a separate line.
Given a positive integer N
, your task is to identify all prime numbers less than or equal to N
.
A prime number is a natural number greater than 1 that has no po...
Identify all prime numbers less than or equal to a given positive integer N.
Iterate from 2 to N and check if each number is prime
Use the Sieve of Eratosthenes algorithm for efficient prime number identification
Optimize by only checking up to the square root of N for divisors
BCNF is a normal form in database management systems that ensures all determinants are candidate keys.
BCNF stands for Boyce-Codd Normal Form.
It is a stricter version of 3NF (Third Normal Form).
In BCNF, every determinant must be a candidate key.
It helps in reducing redundancy and anomalies in the database.
Example: If a table has columns A, B, and C, and A determines B and B determines C, then it is not in BCNF unless A ...
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 uses structures for data organization, while C++ uses classes.
C does not have features like inheritance an...
Round duration - 60 minutes
Round difficulty - Easy
Again 2nd round started with an introduction from both sides. Then he started asking questions from resume itself. Working in the current company and all the projects that i have done. Few simple puzzles, OOPs concepts (with proper explanation and coding) and some database related questions(questions were easy you just need to brush up the basics). Some keywords related questions from C,C++,Java(usual questions like static ,final, abstract etc.). That was the 2nd round. Then I was called for the 3rd Round. Before 3rd round they also served tasty lunch.
Given a binary tree of integers, your task is to output the right view of the tree.
The right view of a binary tree includes the nodes that are visible when the tree is observed...
The task is to output the right view of a binary tree, which includes the nodes visible when observed from the right.
Traverse the tree level by level and keep track of the rightmost node at each level.
Use a queue for level order traversal and a map to store the rightmost nodes.
Print the values of the rightmost nodes stored in the map as the right view of the tree.
Round duration - 45 minutes
Round difficulty - Easy
After that he asked me what I knew about SAP and there products(Please do read all about SAP and there products-not all but at least some famous products like ERP). Then he asked me one puzzle.
Round duration - 45 minutes
Round difficulty - Easy
The round started with our Introduction to each other. After that interviewer asked me whether I do online shopping or not. I said yes then he asked me to design the online shopping portal using ER-Diagram . Then he asked me to create all the tables and populate it with data. Later on he asked me to normalize it. After all of this he asked me some simple puzzles and current salary and notice period. That was the 4th round.
After that I was asked to attend the final round and before 5th round they served snacks and tea to all of us.
Yes, I can design an ER diagram for an online shopping portal.
Entities: User, Product, Order, Payment, Cart
Relationships: User places Order, Order contains Product, Payment for Order, User has Cart
Attributes: User (id, name, email), Product (id, name, price), Order (id, date), Payment (id, amount)
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.
Top trending discussions
The duration of SAP Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 6 interview experiences
Difficulty level
Duration
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