SAP

go.sap.com
Engaged Employer

# SAP Developer (F/M) for Cutting-edge Applications Interview Questions

1 Interview Review

0%
0%
100%

100%

3.0
Average

Hard

Average

Easy

## 1 Candidate Interview Review Back to all Interviews

Sort: Popular Date Difficulty

## Developer (F/M) for Cutting-edge Applications Interview

Declined Offer
Negative Experience
Average Interview

Application

I applied online. The process took 2+ weeksinterviewed at SAP in April 2012.

Interview

First, HR interview: backgroud and qualification check Second: online interview and online coding, and ask many basic questions about java programming. Thrid round: interview, code discussion, ask many questions about project management such as crum model, java programming, and the background, etc. Discuss the code which was implemented before the interview.

Interview Questions

• The first round: Phone interview + online coding: ?You are given an array of n integers, each of which may be positive, negative or zero. Give an algorithm to identify the start and end index, i and j, of the interval whose elements form the maximal sum of all possible intervals. Assume j &gt;=i e.g. {1 3 -8 2 -1 10 -2 1} -&gt; i=3 , j=5 – sum = 11 Example non-maximal sum intervals: i=0, j=5 – sum = 7 i=2, j=4 – sum = -7   Answer Question
• The second round interview: Implement a binary tree with the given interface, then discuss the implementation via remote desktop and phone. /* * An interface for an sorted binary tree. * * The interface provides methods for inserting values, checking if certain values are contained and iterating over the elements. * Note: Implementing classes should provide an iterator that traverse the inserted object in the sorted order. */ public interface IBinTree&lt;V extends Comparable&lt;V&gt;&gt; extends Iterable&lt;V&gt; { /* * Insert an object into the binary tree. Note: The tree should be sorted, inserting the same object twice is allowed but the insert is expected to be stable. */ void insert(V obj); /* * Batch-insert multiple elements. */ void insert(Vector&lt;V&gt; vec); /* * Check if the object is already in the tree. Return true if it is, false otherwise. */ boolean contains(V obj); }   Answer Question
Don't Miss Out On a Job You Love
Upload a resume to easily apply to jobs from anywhere. It's simple to set up.

The difficulty rating is the average interview difficulty rating across all interview candidates.

The interview experience is the percentage of all interview candidates that said their interview experience was positive, neutral, or negative.

Your response will be removed from the review – this cannot be undone.