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 Associate Software Engineer Interview Questions and Answers

Updated 27 Sep 2024

SAP Associate Software Engineer Interview Experiences

3 interviews found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Coding Test 

It was easy. Only basic questions were asked.

Round 2 - Technical 

(2 Questions)

  • Q1. What was your project?
  • Ans. 

    Developed a web-based inventory management system for a retail company

    • Used HTML, CSS, and JavaScript for front-end development

    • Utilized PHP and MySQL for back-end development

    • Implemented features such as product tracking, order processing, and reporting

    • Collaborated with team members to ensure project completion within deadline

  • Answered by AI
  • Q2. How can you improve your website?
  • Ans. 

    Improving a website involves optimizing performance, enhancing user experience, and updating content regularly.

    • Optimize website speed by compressing images and minifying code

    • Enhance user experience by improving navigation and adding interactive features

    • Update content regularly to keep information fresh and relevant

  • Answered by AI
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Referral and was interviewed in Jul 2023. 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 - Assignment 

Platform - Hackerrank
time- 90 minutes
2 dsa questions
output- got link for technical interview same day

Round 3 - Technical 

(2 Questions)

  • Q1. Binary tree traversal
  • Q2. Longest common subsequence
  • Ans. 

    Longest common subsequence is the longest sequence of characters that appear in the same order in both strings.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the lengths of longest common subsequences.

    • Iterate through the strings and fill the array based on the characters' matches.

    • Trace back the array to find the actual longest common subsequence.

  • Answered by AI
Round 4 - Technical 

(2 Questions)

  • Q1. Medium questions on OOPS
  • Ans. Questions on polymorphism and a design class question
  • Answered Anonymously
  • Q2. Explain all projects
  • Ans. Explain in detail and interviewer asked followup questions
  • Answered Anonymously

Interview Preparation Tips

Topics to prepare for SAP Associate Software Engineer interview:
  • OOPS
Interview preparation tips for other job seekers - Prepare Medium leetcode questions and oops

Skills evaluated in this interview

Are these interview questions helpful?

I appeared for an interview in Apr 2022.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This round had 2 questions with Easy to Medium level of difficulty

  • Q1. 

    Problem: Total Area of Overlapping Rectangles

    You are given two rectangles situated on a 2-D coordinate plane, which may overlap. Your task is to compute the total area covered by these rectangles.

    Input...
  • Ans. 

    Calculate total area covered by two overlapping rectangles on a 2-D plane.

    • Calculate the area of each rectangle separately using the given coordinates.

    • Find the overlapping region by determining the intersection of the two rectangles.

    • Calculate the area of the overlapping region by multiplying its width and height.

    • Add the areas of the two rectangles and subtract the area of the overlapping region to get the total area cov...

  • Answered by AI
  • Q2. 

    Rearrange Array: Move Negative Numbers to the Beginning

    Given an array ARR consisting of N integers, rearrange the elements such that all negative numbers are located before all positive numbers. The orde...

  • Ans. 

    Yes, this can be achieved by using a two-pointer approach to rearrange the array with negative numbers at the beginning.

    • Use two pointers, one starting from the beginning and one from the end of the array.

    • Swap elements at the two pointers if one is negative and the other is positive, and move the pointers accordingly.

    • Continue this process until the two pointers meet in the middle of the array.

    • The resulting array will ha...

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 70 minutes
Round difficulty - Medium

Standard DS/Algo round with 2 questions

  • Q1. 

    Middle Node of a Linked List Problem Statement

    Given the head node of a singly linked list, return a pointer to the middle node of the linked list. If there are an odd number of nodes, return the middle o...

  • Ans. 

    Return the middle node of a singly linked list, considering odd and even number of nodes.

    • Traverse the linked list with two pointers, one moving at twice the speed of the other

    • When the faster pointer reaches the end, the slower pointer will be at the middle node

    • Handle cases for odd and even number of nodes separately

    • Return null if the list is empty

  • Answered by AI
  • Q2. 

    All Prime Numbers Less Than or Equal to N

    Given a positive integer N, your task is to return all the prime numbers less than or equal to N.

    Note:

    1) A prime number is a number that has only two factors:...
  • Ans. 

    Return 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 using a helper function.

    • A number is prime if it is not divisible by any number from 2 to its square root.

    • Store and return the prime numbers in an array in increasing order.

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This was a Technical Cum HR round where I was first asked some basic Java-related concepts and then we discussed my expectations from the company, learnings and growth in the forthcoming years. I would suggest be honest and try to communicate your thoughts properly in these types of rounds to maximise your chances of getting selected.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Associate Software Engineer in BangaloreEligibility criteria0-3 years of ExperienceSAP Labs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, SQL, Angular, JavaTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

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.


 

Application resume tips for other job seekers

Tip 1 : Resume should be informative but not more than two pages
Tip 2 : Provide the links of all your achievements, projects and certificates in your resume

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

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

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

Interview Questionnaire 

1 Question

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

Interview Questionnaire 

1 Question

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

SAP Interview FAQs

How many rounds are there in SAP Associate Software Engineer interview?
SAP interview process usually has 3 rounds. The most common rounds in the SAP interview process are Technical, Resume Shortlist and Assignment.
What are the top questions asked in SAP Associate Software Engineer interview?

Some of the top questions asked at the SAP Associate Software Engineer interview -

  1. Longest common subseque...read more
  2. Binary tree traver...read more
  3. medium questions on O...read more

Tell us how to improve this page.

Overall Interview Experience Rating

5/5

based on 2 interview experiences

Difficulty level

Moderate 100%

Duration

Less than 2 weeks 50%
2-4 weeks 50%
View more
SAP Associate Software Engineer Salary
based on 47 salaries
₹12 L/yr - ₹18.3 L/yr
153% more than the average Associate Software Engineer Salary in India
View more details

SAP Associate Software Engineer Reviews and Ratings

based on 11 reviews

4.7/5

Rating in categories

4.3

Skill development

4.9

Work-life balance

3.7

Salary

4.9

Job security

4.9

Company culture

3.5

Promotions

4.2

Work satisfaction

Explore 11 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