Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by SAP Team. If you also belong to the team, you can get access from here

SAP Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

SAP Developer Associate Interview Questions and Answers for Freshers

Updated 13 Apr 2025

SAP Developer Associate Interview Experiences for Freshers

1 interview found

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

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. 

  • Q1. 

    Inorder Successor in a Binary Tree

    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 ...

  • Ans. 

    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...

  • Answered by AI
  • Q2. 

    Uncommon Characters Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

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.

  • Q1. 

    Reverse a Linked List Iteratively

    You are given a singly linked list of integers. The task is to return the head of the reversed linked list.

    Example:

    Input:
    The given linked list is 1 -> 2 -> 3 ...
  • Ans. 

    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).

  • Answered by AI
Round 3 - Face to Face 

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 4 - Face to Face 

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.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Delhi Technological University. I applied for the job as Developer Associate in BangaloreEligibility criteria7 cgpaSAP Labs interview preparation:Topics to prepare for the interview - Database Management System, Operating System, Bit Manipulation, Object Oriented Programming, Data Structures, Machine Learning basicsTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed before Dec 2021. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

Quantitative, Reasoning, DBMS Concepts, Flow chart questions

Round 3 - Technical 

(2 Questions)

  • Q1. Merge sort explain and write code
  • Ans. 

    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)

  • Answered by AI
  • Q2. OOPS Concepts, Computer Network concepts
Round 4 - Technical 

(2 Questions)

  • Q1. Check if there is Loop in a Linked List
  • Ans. 

    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...

  • Answered by AI
  • Q2. Tell about the experience of your college

Interview Preparation Tips

Interview preparation tips for other job seekers - Explain your approach properly to the interviewer. Be confident.

Skills evaluated in this interview

Developer Associate Interview Questions Asked at Other Companies for Fresher

asked in FICO
Q1. Cycle Detection in a Singly Linked List Determine if a given sing ... read more
asked in SAP
Q2. Reverse a Linked List Iteratively You are given a singly linked l ... read more
asked in SAP
Q3. Inorder Successor in a Binary Tree Given a node in an arbitrary b ... read more
asked in SAP
Q4. Uncommon Characters Problem Statement Given two strings str1 and ... read more
asked in Cognizant
Q5. Merge Sort Problem Statement You are given a sequence of numbers, ... read more

I applied via Company Website and was interviewed before Oct 2019. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. 1. Core Java - OOPS features, Abstract classes and Interface, Inner Classes, String and Object Class, Equals and HashCode methods, Runtime and Compile time exception, Method overloading and overriding, Cus...

Interview Preparation Tips

Interview preparation tips for other job seekers - 1. Clear Core java concepts firmly
2. Basic DB queries
3. Basic Unix commands

I appeared for an interview before Sep 2020.

Round 1 - Face to Face 

(1 Question)

Round duration - 50 minutes
Round difficulty - Easy

This was a Data Structural round.

  • Q1. 

    Distinct Islands Problem Statement

    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...

  • Ans. 

    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

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 50 minutes
Round difficulty - Easy

This was a Data Structural round.

  • Q1. 

    Word Wrap Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

This was a System Design round.

  • Q1. Can you design a system similar to Red Bus that can handle bookings and onboard both vendors and customers to the platform?
  • Ans. 

    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...

  • Answered by AI
Round 4 - Face to Face 

Round duration - 50 minutes
Round difficulty - Easy

This was a System Design round

Round 5 - Face to Face 

Round duration - 50 minutes
Round difficulty - Easy

This was an HR round.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Indian Institute of Technology Roorkee. Microsoft interview preparation:Topics to prepare for the interview - Graphs, Dynamic Programming, Arrays, LinkedList, stringsTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

Tip 1 : Keep only relevant things for the job you are applying.
Tip 2 : Minimal data with measurable contribution and effect.

Final outcome of the interviewSelected

Skills evaluated in this interview

What people are saying about SAP

View All
a senior software engineer
4d
Salary at SAP Labs
Hi team, at SAP Labs , which level will be offered for 4 years of experience lateral hire, What is the ctc range for t2 l2 and minimum experience Also what is the ctc range for t2 l3 and minimum experience Current ctc 14.75 lpa
Got a question about SAP?
Ask anonymously on communities.

I appeared for an interview before Sep 2020.

Round 1 - Video Call 

(1 Question)

Round duration - 1 hour
Round difficulty - Medium

  • Q1. 

    First Missing Positive Problem Statement

    You are provided with an integer array ARR of length 'N'. Your objective is to determine the first missing positive integer using linear time and constant space. T...

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaNoneMicrosoft interview preparation:Topics to prepare for the interview - Data structures, Pointers, Microsoft Cloud, Computer Architecture, Dynamic Programming, Azure Services,Time required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : During an interview, never say that you don't know the answer, keep trying and the interviewer will help you himself.
Tip 2 : Keep speaking up the approach going on in your mind, they want to judge your approaches much more than whether the answer is right or wrong.
Tip 3 : Be confident, cheerful, keep smiling, and continue making eye contact with the interviewer, this leaves a positive impression.
Tip 4 : Search and practice questions specific to the company, questions are repeated several times.
Tip 5 :  A sound knowledge of Microsoft Azure Services and cloud computing will be an icing on the cake, and increase your chances to get selected.
Tip 6 : Keep giving contests on coding platforms, it will help you to stay motivated and check your stand.
Tip 7 : Keep a daily goal of number of questions instead of the time duration.

Application resume tips for other job seekers

Tip 1 : Everything mentioned on the resume should be thoroughly known to you since if they catch you being dishonest, pretty good coding skills also might not help.
Tip 2 : Have projects related to the same field you are trying to apply for mentioned in your resume, this shows you are already experienced in the field.
Tip 3 : Adding references of some experienced people of the same field might help you gain their trust.
Tip 4 : Do not keep your resume too long, and do not mention irrelevant details, keep it short and crisp.
Tip 5 : Some experience in the field of operations and management or some positions of responsibility will really help you score extra points since it shows you have leadership qualities and are familiar with the market along with super coding skills.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Easy

This round was the online coding test conducted on the platform Mettl. The languages allowed were C, C++, Java and Python. There were three questions. One was of graphs (Depth-first search), other was a big integer problem and the third was a string problem.

  • Q1. 

    Graph Coloring Problem Statement

    You are provided with a graph consisting of N vertices, numbered from 1 to N, and M edges. Your task is to color the graph using two colors, Blue and Red, such that no two...

  • Ans. 

    Given a graph with vertices and edges, determine if it can be colored using two colors without adjacent vertices sharing the same color.

    • Check if the graph is bipartite using graph coloring algorithm like BFS or DFS.

    • If the graph is bipartite, return 'Possible' with a valid coloring assignment.

    • If the graph is not bipartite, return 'Impossible'.

  • Answered by AI
  • Q2. 

    String Compression Problem Statement

    Write a program to perform basic string compression. For each character that repeats consecutively more than once, replace the consecutive duplicate occurrences with t...

  • Ans. 

    Write a program to compress a string by replacing consecutive duplicate characters with the character followed by the number of repetitions.

    • Iterate through the string and count consecutive occurrences of each character

    • Append the character and its count to a new string

    • Return the compressed string if it is shorter than the original, else return the original string

    • Handle edge cases like single characters or when compresse...

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

This was a pen and paper subjective interview round. You were expected to write full code on paper. Make sure you use proper names for the variables and write comments explaining very clearly what the code does. Also, try writing code in good handwriting which can be understood by the interviewer.

  • Q1. Find the total number of palindromic substrings in a given string.
  • Ans. 

    Count total palindromic substrings in a given string.

    • Iterate through each character in the string and consider it as the center of a palindrome. Expand outwards to find all palindromic substrings.

    • Use dynamic programming to efficiently check if a substring is a palindrome.

    • Consider both odd-length and even-length palindromes.

    • Example: Input 'ababa', output 7 (a, b, a, b, a, aba, aba)

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Easy

The interview took place in the morning and the interviewer was very friendly.

  • Q1. 

    Count Inversions Problem Statement

    Let A[0 ... n-1] be an array of n distinct positive integers. An inversion of A is a pair of indices (i, j) such that i < j and A[i] > A[j]. Given an integer array...

  • Ans. 

    Count the number of inversions in an array of distinct positive integers.

    • Use merge sort algorithm to count inversions efficiently.

    • Divide the array into two halves and recursively count inversions in each half.

    • Merge the two sorted halves while counting split inversions.

    • Time complexity can be optimized to O(n log n) using merge sort.

    • Example: For input A = [2, 4, 1, 3, 5], the output should be 3.

  • Answered by AI
  • Q2. 

    Sum Tree Conversion Problem Statement

    Transform a given binary tree into a sum tree where each node is replaced by the sum of its immediate children's values. Leaf nodes should be replaced with 0. Then, p...

  • Ans. 

    Convert a binary tree into a sum tree by replacing each node with the sum of its children's values, and return the preorder traversal.

    • Traverse the tree recursively and replace each node with the sum of its children's values

    • Leaf nodes should be replaced with 0

    • Perform a preorder traversal on the transformed sum tree to get the final result

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

The HR Interview round was held in the morning and it was right after my technical interview.

Interview Preparation Tips

Professional and academic backgroundI completed Electrical Engineering from Indian Institute of Technology (Indian School of Mines), Dhanbad. I applied for the job as SDE - 1 in HyderabadEligibility criteria7 CGPAMicrosoft interview preparation:Topics to prepare for the interview - Data Structures - Arrays, Strings, Linked List, Trees, Binary Search Tree, Graph, Tries, Fenwick Trees, Segment Trees, Hashmap. Algorithms - Recursion, Ad Hoc, Dynamic Programming, Greedy, Binary Search, Breadth-first search, Depth-first search, Sorting .Time required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Just be confident during interview and if you are stuck in between any question, then ask for a hint from the interviewer. The practice is key for success, so practice hard for Data Structures and Algorithms coding problems on Coding ninjas as it is the best platform for coding. Also you may practice on Geeks For Geeks or any other interview portal. 

Application resume tips for other job seekers

Mention all internships which you have done, as it increases your chances of shortlisting your resume. Also just write that skills which you are pretty confident about.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

9 Questions

  • Q1. System design of traffic signal
  • Ans. 

    Design a traffic signal system

    • Identify the number of lanes and intersections

    • Determine the traffic flow and peak hours

    • Choose appropriate sensors and controllers

    • Implement a synchronization algorithm

    • Consider emergency vehicle prioritization

    • Include pedestrian crossing signals

    • Ensure compliance with local regulations

  • Answered by AI
  • Q2. Data structures
  • Q3. Oops spring jdbc
  • Q4. Hashmap implementation
  • Ans. 

    Hashmap is a data structure that stores key-value pairs and provides constant time complexity for insertion, deletion, and retrieval.

    • Hashmap uses hashing function to map keys to indices in an array

    • Collisions can occur when multiple keys map to the same index, which can be resolved using separate chaining or open addressing

    • Java implementation: HashMap<String, Integer> map = new HashMap<>();

  • Answered by AI
  • Q5. Pattern printing code
  • Q6. Common point in linked list
  • Ans. 

    Common point in linked list refers to the node where two or more linked lists intersect.

    • The common point can be found by traversing both linked lists and comparing the nodes.

    • The common point can also be found by using two pointers, one for each linked list, and moving them until they meet at the common point.

    • Examples include finding the intersection point of two linked lists or finding the loop in a linked list.

  • Answered by AI
  • Q7. Optimization
  • Q8. Synchronisation
  • Q9. Threads

Skills evaluated in this interview

Are these interview questions helpful?

Interview Questionnaire 

1 Question

  • Q1. All technical questions not even single irrelevant question.

Intern Interview Questions & Answers

Google user image Anonymous

posted on 28 Apr 2022

I applied via LinkedIn and was interviewed before Apr 2021. There were 2 interview rounds.

Round 1 - Aptitude Test 

It was quite good

Round 2 - Assignment 

Assignment was real world based

Interview Preparation Tips

Interview preparation tips for other job seekers - do your best and try to excel basic skills.

Interview Questionnaire 

1 Question

  • Q1. Data Structures, Algorithms, System designing, Azure

SAP Interview FAQs

How many rounds are there in SAP Developer Associate interview for freshers?
SAP interview process for freshers usually has 4 rounds. The most common rounds in the SAP interview process for freshers are Technical, Coding Test and HR.
How to prepare for SAP Developer Associate interview for freshers?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at SAP. The most common topics and skills that interviewers at SAP expect are Javascript, Java, ABAP, Agile and Software Design.
What are the top questions asked in SAP Developer Associate interview for freshers?

Some of the top questions asked at the SAP Developer Associate interview for freshers -

  1. Technical round where basic understanding of the topics like Java, Dbms, DS, My...read more
  2. How to reverse a linked list and write program to get right view of a binary tr...read more
  3. Have you worked with CDS views and implemented the RAP framewo...read more
What are the most common questions asked in SAP Developer Associate HR round for freshers?

The most common HR questions asked in SAP Developer Associate interview are for freshers -

  1. What are your strengths and weakness...read more
  2. Where do you see yourself in 5 yea...read more
  3. Why should we hire y...read more
How long is the SAP Developer Associate interview process?

The duration of SAP Developer Associate interview process can vary, but typically it takes about less than 2 weeks to complete.

Tell us how to improve this page.

Interview Questions from Similar Companies

Google Interview Questions
4.4
 • 901 Interviews
Oracle Interview Questions
3.7
 • 896 Interviews
Zoho Interview Questions
4.2
 • 540 Interviews
Amdocs Interview Questions
3.7
 • 534 Interviews
KPIT Technologies Interview Questions
3.2
 • 307 Interviews
Adobe Interview Questions
3.8
 • 248 Interviews
Salesforce Interview Questions
4.0
 • 234 Interviews
View all
SAP Developer Associate Salary
based on 1k salaries
₹10.8 L/yr - ₹18.5 L/yr
68% more than the average Developer Associate Salary in India
View more details

SAP Developer Associate Reviews and Ratings

based on 115 reviews

4.2/5

Rating in categories

3.8

Skill development

4.5

Work-life balance

3.3

Salary

4.4

Job security

4.5

Company culture

3.2

Promotions

3.7

Work satisfaction

Explore 115 Reviews and Ratings
Software Developer
1.3k salaries
unlock blur

₹14.1 L/yr - ₹27 L/yr

Developer Associate
1k salaries
unlock blur

₹10.8 L/yr - ₹18.7 L/yr

Developer
909 salaries
unlock blur

₹16 L/yr - ₹28 L/yr

Senior Developer
574 salaries
unlock blur

₹25.2 L/yr - ₹45 L/yr

Business Process Consultant
484 salaries
unlock blur

₹16.8 L/yr - ₹35 L/yr

Explore more salaries
Compare SAP with

Oracle

3.7
Compare

SAS

4.1
Compare

Zoho

4.2
Compare

IBM

3.9
Compare
write
Share an Interview