i
SAP
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.
This round had 20 questions on Basics of ABAP
I applied via Company Website and was interviewed in Aug 2023. There were 4 interview rounds.
Binary trees are hierarchical data structures composed of nodes, where each node has at most two children.
Consists of nodes with at most two children - left and right
Each node can have zero, one, or two children
Used in various applications like binary search trees, expression trees, etc.
I applied via Naukri.com and was interviewed in Nov 2021. There were 5 interview rounds.
Open book coding test. Depends on the format. I had 2 questions to code in 45 minutes
SAP interview questions for designations
I appeared for an interview in Dec 2020.
I applied via LinkedIn and was interviewed in Mar 2021. There were 4 interview rounds.
To reverse a linked list, we need to traverse the list and change the direction of the pointers. To get the right view of a binary tree, we need to traverse the tree and keep track of the rightmost node at each level.
To reverse a linked list, we can use three pointers to keep track of the current, previous, and next nodes.
To get the right view of a binary tree, we can use a queue to traverse the tree level by level and...
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 26 Oct 2020
I applied via Naukri.com and was interviewed in Sep 2020. There were 4 interview rounds.
Data scraping, computer vision, agile methodologies, change request, and testing methods are all important aspects of software engineering.
Data scraping involves extracting data from websites or other sources.
Computer vision involves using algorithms to interpret and analyze visual data.
Agile methodologies are a set of principles for software development that prioritize flexibility and collaboration.
Change requests are...
posted on 30 Nov 2021
I applied via Recruitment Consultant and was interviewed before Nov 2020. There were 3 interview rounds.
Find sum of squares of numbers in list using stream API.
Use mapToInt() to convert list of integers to IntStream
Use map() to square each element of IntStream
Use sum() to get the sum of squares
Searching in 2D sorted array row wise and column wise.
Start from the top right corner or bottom left corner
Compare the target with the current element
Move left or down if target is smaller or move right or up if target is larger
Repeat until target is found or out of bounds
Some of the top questions asked at the SAP Developer Associate interview for experienced candidates -
based on 3 interviews
2 Interview rounds
based on 112 reviews
Rating in categories
Software Developer
1.2k
salaries
| ₹8.3 L/yr - ₹32.7 L/yr |
Developer
920
salaries
| ₹10.2 L/yr - ₹34 L/yr |
Developer Associate
863
salaries
| ₹7.8 L/yr - ₹22.5 L/yr |
Senior Developer
531
salaries
| ₹13.1 L/yr - ₹50 L/yr |
Business Process Consultant
453
salaries
| ₹10 L/yr - ₹40 L/yr |
Oracle
SAS
Zoho
IBM