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

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

1 Interview Review

Experience

Experience
0%
0%
100%

Getting an Interview

Getting an Interview
100%

Difficulty

3.0
Average

Difficulty

Hard
Average
Easy

1 Candidate Interview ReviewBack to all Interviews

Filter

Sort: PopularDateDifficulty

Filter

Sort: PopularDateDifficulty

 

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

Anonymous Interview Candidate
Declined Offer
Negative Experience
Average Interview

Application

I applied online. The process took 2+ weeks. I interviewed 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 >=i

    e.g. {1 3 -8 2 -1 10 -2 1} -> 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<V extends Comparable<V>> extends Iterable<V> {
        /*
         * 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<V> 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.